./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-properties/alternating_list-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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/list-properties/alternating_list-1.i -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 941f3dd0e4566f414ae914eed10af26405f8e9f2f3d427c146090b07336d2fc2 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 03:14:45,680 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:14:45,682 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:14:45,716 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:14:45,721 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:14:45,721 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:14:45,722 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:14:45,727 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:14:45,728 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:14:45,729 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:14:45,729 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:14:45,733 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:14:45,733 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:14:45,734 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:14:45,734 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:14:45,736 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:14:45,737 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:14:45,739 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:14:45,740 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:14:45,744 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:14:45,745 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:14:45,748 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:14:45,749 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:14:45,750 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:14:45,750 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:14:45,752 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:14:45,756 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:14:45,756 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:14:45,757 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:14:45,758 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:14:45,758 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:14:45,758 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:14:45,759 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:14:45,759 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:14:45,760 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:14:45,761 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:14:45,762 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:14:45,762 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:14:45,762 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:14:45,763 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:14:45,763 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:14:45,764 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:14:45,765 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 03:14:45,785 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:14:45,785 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:14:45,786 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:14:45,786 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:14:45,786 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:14:45,787 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:14:45,787 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:14:45,787 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:14:45,788 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:14:45,788 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:14:45,788 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:14:45,789 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 03:14:45,789 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:14:45,789 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:14:45,789 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:14:45,789 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:14:45,789 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:14:45,789 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:14:45,790 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:14:45,790 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:14:45,791 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:14:45,791 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:14:45,791 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:14:45,791 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:14:45,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:14:45,792 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:14:45,792 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:14:45,792 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:14:45,792 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 03:14:45,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 03:14:45,793 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:14:45,793 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:14:45,793 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:14:45,793 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 -> 941f3dd0e4566f414ae914eed10af26405f8e9f2f3d427c146090b07336d2fc2 [2022-07-12 03:14:45,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:14:46,023 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:14:46,025 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:14:46,026 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:14:46,027 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:14:46,028 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/alternating_list-1.i [2022-07-12 03:14:46,077 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a64d5d115/1c1b625f7e8642589e844eccd31adac5/FLAG0646849e7 [2022-07-12 03:14:46,506 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:14:46,506 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/alternating_list-1.i [2022-07-12 03:14:46,513 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a64d5d115/1c1b625f7e8642589e844eccd31adac5/FLAG0646849e7 [2022-07-12 03:14:46,521 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a64d5d115/1c1b625f7e8642589e844eccd31adac5 [2022-07-12 03:14:46,523 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:14:46,524 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:14:46,527 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:14:46,527 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:14:46,529 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:14:46,530 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:14:46" (1/1) ... [2022-07-12 03:14:46,530 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15dd15eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:14:46, skipping insertion in model container [2022-07-12 03:14:46,530 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:14:46" (1/1) ... [2022-07-12 03:14:46,535 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:14:46,555 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:14:46,741 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/list-properties/alternating_list-1.i[23574,23587] [2022-07-12 03:14:46,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:14:46,752 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:14:46,776 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/list-properties/alternating_list-1.i[23574,23587] [2022-07-12 03:14:46,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:14:46,793 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:14:46,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:14:46 WrapperNode [2022-07-12 03:14:46,793 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:14:46,794 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:14:46,794 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:14:46,794 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:14:46,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:14:46" (1/1) ... [2022-07-12 03:14:46,807 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:14:46" (1/1) ... [2022-07-12 03:14:46,819 INFO L137 Inliner]: procedures = 124, calls = 23, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 85 [2022-07-12 03:14:46,819 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:14:46,820 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:14:46,820 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:14:46,820 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:14:46,825 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:14:46" (1/1) ... [2022-07-12 03:14:46,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:14:46" (1/1) ... [2022-07-12 03:14:46,828 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:14:46" (1/1) ... [2022-07-12 03:14:46,828 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:14:46" (1/1) ... [2022-07-12 03:14:46,832 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:14:46" (1/1) ... [2022-07-12 03:14:46,835 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:14:46" (1/1) ... [2022-07-12 03:14:46,836 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:14:46" (1/1) ... [2022-07-12 03:14:46,850 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:14:46,850 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:14:46,850 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:14:46,851 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:14:46,851 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:14:46" (1/1) ... [2022-07-12 03:14:46,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:14:46,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:14:46,879 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-12 03:14:46,880 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-12 03:14:46,909 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-07-12 03:14:46,909 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-07-12 03:14:46,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 03:14:46,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 03:14:46,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 03:14:46,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:14:46,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 03:14:46,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 03:14:46,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 03:14:46,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 03:14:46,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:14:46,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:14:46,999 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:14:47,000 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:14:47,040 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-07-12 03:14:47,116 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:14:47,129 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:14:47,129 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-12 03:14:47,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:14:47 BoogieIcfgContainer [2022-07-12 03:14:47,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:14:47,132 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:14:47,132 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:14:47,134 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:14:47,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:14:46" (1/3) ... [2022-07-12 03:14:47,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72447a4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:14:47, skipping insertion in model container [2022-07-12 03:14:47,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:14:46" (2/3) ... [2022-07-12 03:14:47,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72447a4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:14:47, skipping insertion in model container [2022-07-12 03:14:47,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:14:47" (3/3) ... [2022-07-12 03:14:47,136 INFO L111 eAbstractionObserver]: Analyzing ICFG alternating_list-1.i [2022-07-12 03:14:47,144 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:14:47,144 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 03:14:47,185 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:14:47,195 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@72ca504c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@77b27487 [2022-07-12 03:14:47,195 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 03:14:47,198 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 26 states have (on average 1.5) internal successors, (39), 28 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:14:47,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 03:14:47,202 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:14:47,203 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:14:47,203 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:14:47,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:14:47,207 INFO L85 PathProgramCache]: Analyzing trace with hash 930969484, now seen corresponding path program 1 times [2022-07-12 03:14:47,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:14:47,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69192786] [2022-07-12 03:14:47,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:14:47,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:14:47,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:47,334 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-12 03:14:47,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:14:47,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69192786] [2022-07-12 03:14:47,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69192786] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:14:47,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:14:47,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 03:14:47,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876658656] [2022-07-12 03:14:47,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:14:47,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 03:14:47,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:14:47,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 03:14:47,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:14:47,370 INFO L87 Difference]: Start difference. First operand has 30 states, 26 states have (on average 1.5) internal successors, (39), 28 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 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 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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-12 03:14:47,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:14:47,384 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2022-07-12 03:14:47,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 03:14:47,386 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-07-12 03:14:47,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:14:47,391 INFO L225 Difference]: With dead ends: 46 [2022-07-12 03:14:47,392 INFO L226 Difference]: Without dead ends: 19 [2022-07-12 03:14:47,394 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-12 03:14:47,397 INFO L413 NwaCegarLoop]: 37 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, 37 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-12 03:14:47,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:14:47,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-07-12 03:14:47,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-07-12 03:14:47,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:14:47,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-07-12 03:14:47,423 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 11 [2022-07-12 03:14:47,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:14:47,423 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-07-12 03:14:47,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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-12 03:14:47,424 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-07-12 03:14:47,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 03:14:47,425 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:14:47,425 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:14:47,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 03:14:47,425 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:14:47,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:14:47,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1797355599, now seen corresponding path program 1 times [2022-07-12 03:14:47,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:14:47,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457875137] [2022-07-12 03:14:47,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:14:47,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:14:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:47,509 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-12 03:14:47,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:14:47,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457875137] [2022-07-12 03:14:47,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457875137] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:14:47,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:14:47,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:14:47,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80035214] [2022-07-12 03:14:47,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:14:47,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:14:47,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:14:47,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:14:47,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:14:47,514 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:14:47,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:14:47,546 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-07-12 03:14:47,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:14:47,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-12 03:14:47,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:14:47,548 INFO L225 Difference]: With dead ends: 47 [2022-07-12 03:14:47,548 INFO L226 Difference]: Without dead ends: 32 [2022-07-12 03:14:47,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:14:47,552 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 12 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:14:47,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 39 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:14:47,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-12 03:14:47,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2022-07-12 03:14:47,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:14:47,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-07-12 03:14:47,564 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 12 [2022-07-12 03:14:47,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:14:47,565 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-07-12 03:14:47,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:14:47,565 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-07-12 03:14:47,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 03:14:47,566 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:14:47,566 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:14:47,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 03:14:47,569 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:14:47,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:14:47,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1797348655, now seen corresponding path program 1 times [2022-07-12 03:14:47,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:14:47,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775451055] [2022-07-12 03:14:47,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:14:47,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:14:47,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:47,633 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-12 03:14:47,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:14:47,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775451055] [2022-07-12 03:14:47,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775451055] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:14:47,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:14:47,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:14:47,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122745329] [2022-07-12 03:14:47,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:14:47,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:14:47,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:14:47,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:14:47,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:14:47,637 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:14:47,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:14:47,696 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2022-07-12 03:14:47,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:14:47,697 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-12 03:14:47,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:14:47,698 INFO L225 Difference]: With dead ends: 57 [2022-07-12 03:14:47,698 INFO L226 Difference]: Without dead ends: 42 [2022-07-12 03:14:47,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:14:47,703 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 12 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:14:47,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 56 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:14:47,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-12 03:14:47,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 31. [2022-07-12 03:14:47,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2) internal successors, (36), 30 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-12 03:14:47,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-07-12 03:14:47,713 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 12 [2022-07-12 03:14:47,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:14:47,713 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-07-12 03:14:47,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:14:47,714 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-07-12 03:14:47,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 03:14:47,714 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:14:47,715 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:14:47,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 03:14:47,715 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:14:47,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:14:47,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1890563654, now seen corresponding path program 1 times [2022-07-12 03:14:47,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:14:47,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293185707] [2022-07-12 03:14:47,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:14:47,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:14:47,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:47,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:14:47,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:14:47,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293185707] [2022-07-12 03:14:47,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293185707] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:14:47,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873096194] [2022-07-12 03:14:47,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:14:47,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:14:47,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:14:47,886 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-12 03:14:47,911 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-12 03:14:47,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:47,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-12 03:14:47,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:14:48,016 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 03:14:48,073 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-12 03:14:48,107 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:14:48,107 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 11 treesize of output 11 [2022-07-12 03:14:48,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:14:48,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 03:14:48,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:14:48,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 03:14:48,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:14:48,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:14:48,229 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_76 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_76) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-07-12 03:14:48,256 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_76 (Array Int Int)) (v_ArrVal_75 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_75)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_76) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-07-12 03:14:48,321 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-12 03:14:48,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-07-12 03:14:48,332 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:14:48,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2022-07-12 03:14:48,338 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 9 treesize of output 7 [2022-07-12 03:14:48,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-12 03:14:48,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873096194] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:14:48,486 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:14:48,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2022-07-12 03:14:48,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593401050] [2022-07-12 03:14:48,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:14:48,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-12 03:14:48,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:14:48,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-12 03:14:48,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=250, Unknown=2, NotChecked=66, Total=380 [2022-07-12 03:14:48,488 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:14:52,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:14:52,797 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2022-07-12 03:14:52,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 03:14:52,797 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-12 03:14:52,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:14:52,798 INFO L225 Difference]: With dead ends: 62 [2022-07-12 03:14:52,798 INFO L226 Difference]: Without dead ends: 60 [2022-07-12 03:14:52,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=171, Invalid=700, Unknown=7, NotChecked=114, Total=992 [2022-07-12 03:14:52,799 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 23 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:14:52,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 117 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 113 Invalid, 0 Unknown, 109 Unchecked, 0.1s Time] [2022-07-12 03:14:52,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-07-12 03:14:52,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2022-07-12 03:14:52,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 52 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:14:52,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2022-07-12 03:14:52,803 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 18 [2022-07-12 03:14:52,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:14:52,803 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2022-07-12 03:14:52,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:14:52,804 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2022-07-12 03:14:52,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 03:14:52,804 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:14:52,804 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:14:52,823 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-12 03:14:53,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:14:53,012 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:14:53,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:14:53,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1672328945, now seen corresponding path program 1 times [2022-07-12 03:14:53,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:14:53,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302601593] [2022-07-12 03:14:53,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:14:53,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:14:53,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:53,141 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:14:53,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:14:53,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302601593] [2022-07-12 03:14:53,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302601593] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:14:53,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641562508] [2022-07-12 03:14:53,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:14:53,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:14:53,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:14:53,156 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-12 03:14:53,164 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-12 03:14:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:53,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-12 03:14:53,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:14:53,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 03:14:53,259 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:14:53,259 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 11 treesize of output 11 [2022-07-12 03:14:53,284 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 13 treesize of output 9 [2022-07-12 03:14:53,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 03:14:53,321 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 03:14:53,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 61 [2022-07-12 03:14:53,325 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 29 treesize of output 19 [2022-07-12 03:14:53,327 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 32 treesize of output 34 [2022-07-12 03:14:53,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2022-07-12 03:14:53,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-07-12 03:14:53,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 03:14:53,390 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:14:53,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:14:53,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 57 [2022-07-12 03:14:53,419 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_126 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_126) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_ArrVal_128 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_128) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) is different from false [2022-07-12 03:14:53,435 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:14:53,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-12 03:14:53,440 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:14:53,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 35 [2022-07-12 03:14:53,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:14:53,453 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 03:14:53,454 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2022-07-12 03:14:53,527 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-12 03:14:53,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641562508] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:14:53,528 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:14:53,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-07-12 03:14:53,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916342118] [2022-07-12 03:14:53,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:14:53,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-12 03:14:53,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:14:53,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-12 03:14:53,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=262, Unknown=1, NotChecked=32, Total=342 [2022-07-12 03:14:53,530 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:14:53,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:14:53,768 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2022-07-12 03:14:53,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 03:14:53,769 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-12 03:14:53,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:14:53,769 INFO L225 Difference]: With dead ends: 75 [2022-07-12 03:14:53,769 INFO L226 Difference]: Without dead ends: 55 [2022-07-12 03:14:53,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=592, Unknown=1, NotChecked=50, Total=756 [2022-07-12 03:14:53,770 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 28 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:14:53,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 213 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 230 Invalid, 0 Unknown, 58 Unchecked, 0.1s Time] [2022-07-12 03:14:53,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-12 03:14:53,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2022-07-12 03:14:53,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 52 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:14:53,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2022-07-12 03:14:53,773 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 23 [2022-07-12 03:14:53,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:14:53,774 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2022-07-12 03:14:53,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:14:53,774 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-07-12 03:14:53,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 03:14:53,774 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:14:53,774 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:14:53,803 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-12 03:14:53,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:14:53,975 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:14:53,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:14:53,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1588811868, now seen corresponding path program 2 times [2022-07-12 03:14:53,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:14:53,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471738680] [2022-07-12 03:14:53,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:14:53,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:14:53,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:54,012 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 03:14:54,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:14:54,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471738680] [2022-07-12 03:14:54,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471738680] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:14:54,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:14:54,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:14:54,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925696918] [2022-07-12 03:14:54,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:14:54,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:14:54,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:14:54,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:14:54,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:14:54,013 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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-12 03:14:54,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:14:54,021 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2022-07-12 03:14:54,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:14:54,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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) Word has length 29 [2022-07-12 03:14:54,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:14:54,022 INFO L225 Difference]: With dead ends: 86 [2022-07-12 03:14:54,022 INFO L226 Difference]: Without dead ends: 51 [2022-07-12 03:14:54,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:14:54,022 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 7 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:14:54,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 43 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:14:54,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-12 03:14:54,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2022-07-12 03:14:54,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 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-12 03:14:54,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-07-12 03:14:54,025 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 29 [2022-07-12 03:14:54,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:14:54,026 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-07-12 03:14:54,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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-12 03:14:54,026 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-07-12 03:14:54,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 03:14:54,026 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:14:54,026 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:14:54,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 03:14:54,026 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:14:54,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:14:54,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1117807526, now seen corresponding path program 1 times [2022-07-12 03:14:54,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:14:54,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887033848] [2022-07-12 03:14:54,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:14:54,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:14:54,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:54,285 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:14:54,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:14:54,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887033848] [2022-07-12 03:14:54,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887033848] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:14:54,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354467996] [2022-07-12 03:14:54,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:14:54,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:14:54,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:14:54,287 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-12 03:14:54,293 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-12 03:14:54,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:54,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-12 03:14:54,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:14:54,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 03:14:54,412 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:14:54,412 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 11 treesize of output 11 [2022-07-12 03:14:54,439 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 13 treesize of output 9 [2022-07-12 03:14:54,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 03:14:54,484 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-12 03:14:54,494 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 03:14:54,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2022-07-12 03:14:54,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:14:54,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-07-12 03:14:54,576 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 03:14:54,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 116 [2022-07-12 03:14:54,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:14:54,582 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 51 treesize of output 44 [2022-07-12 03:14:54,591 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 59 [2022-07-12 03:14:54,650 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 03:14:54,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 72 [2022-07-12 03:14:54,666 INFO L356 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-07-12 03:14:54,666 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 65 treesize of output 70 [2022-07-12 03:14:54,676 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-07-12 03:14:54,676 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 29 treesize of output 34 [2022-07-12 03:14:54,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-07-12 03:14:54,702 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 69 treesize of output 57 [2022-07-12 03:14:54,739 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 41 treesize of output 33 [2022-07-12 03:14:54,753 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 53 treesize of output 45 [2022-07-12 03:14:55,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 69 [2022-07-12 03:14:55,108 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 03:14:55,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 45 [2022-07-12 03:14:55,292 INFO L356 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-07-12 03:14:55,293 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 29 treesize of output 25 [2022-07-12 03:14:55,297 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:14:55,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:14:57,503 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (or (not (= (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (forall ((v_ArrVal_252 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (let ((.cse0 (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))) (or (= .cse0 3) (= .cse0 2)))))) is different from false [2022-07-12 03:14:57,547 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_254 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int) (v_ArrVal_249 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse0 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 v_ArrVal_249)))) (store .cse4 |v_ULTIMATE.start_main_~p~0#1.base_39| (store (select .cse4 |v_ULTIMATE.start_main_~p~0#1.base_39|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))))) (let ((.cse1 (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 |c_ULTIMATE.start_main_~t~0#1.offset|)) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (or (not (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= 2 .cse1) (= 3 .cse1)))))) is different from false [2022-07-12 03:14:57,581 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_254 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int) (v_ArrVal_249 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse1 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 v_ArrVal_249)))) (store .cse4 |v_ULTIMATE.start_main_~p~0#1.base_39| (store (select .cse4 |v_ULTIMATE.start_main_~p~0#1.base_39|) 0 3))))) (let ((.cse0 (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 0)) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (or (= .cse0 3) (= .cse0 2) (not (= (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))))) is different from false [2022-07-12 03:14:57,604 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:14:57,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2036 treesize of output 1936 [2022-07-12 03:14:57,631 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:14:57,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1300 treesize of output 1143 [2022-07-12 03:14:58,687 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 8 treesize of output 4 [2022-07-12 03:14:58,733 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 8 treesize of output 4 [2022-07-12 03:14:58,905 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (or (and (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) .cse0) (let ((.cse27 (= |c_ULTIMATE.start_main_~a~0#1.offset| (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))) (let ((.cse1 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (let ((.cse28 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse28 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse28 |v_ULTIMATE.start_main_~p~0#1.base_39|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|)))) (.cse2 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|)))) (.cse9 (and .cse27 .cse0)) (.cse7 (not .cse27)) (.cse8 (not .cse0))) (and (or (and .cse1 .cse2 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (.cse3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (= .cse4 0) (not (= .cse4 .cse3))))) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (let ((.cse5 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_4 .cse5) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse5))))) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((v_ArrVal_254 (Array Int Int))) (let ((.cse6 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse6 0) (= .cse6 |c_ULTIMATE.start_main_~p~0#1.offset|)))))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.offset|))) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |v_ULTIMATE.start_main_~p~0#1.base_39|))))) .cse7 .cse8) (or .cse9 (and .cse1 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((v_ArrVal_254 (Array Int Int))) (let ((.cse10 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse10 0) (= .cse10 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (= .cse10 |c_ULTIMATE.start_main_~p~0#1.offset|)))))) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|))) .cse2 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((v_ArrVal_254 (Array Int Int))) (let ((.cse11 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse11 0) (not (= .cse11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))))) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (let ((.cse12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_4 .cse12) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse12))))) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |v_ULTIMATE.start_main_~p~0#1.base_39|)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (let ((.cse13 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse14 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (not (= (select v_arrayElimArr_4 .cse13) 0)) (= .cse14 .cse13) (= .cse14 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |v_ULTIMATE.start_main_~p~0#1.base_39|)))))) (or (let ((.cse15 (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (let ((.cse26 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse26 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse26 |v_ULTIMATE.start_main_~p~0#1.base_39|))))) (.cse17 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|)))))) (and (or .cse9 (and .cse15 (forall ((v_arrayElimArr_4 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (not (= (select v_arrayElimArr_4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((v_ArrVal_254 (Array Int Int))) (let ((.cse16 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse16 0) (not (= .cse16 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))))) .cse17 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (let ((.cse18 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_4 .cse18) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse18))))) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |v_ULTIMATE.start_main_~p~0#1.base_39|)))) (forall ((v_arrayElimArr_4 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (not (= (select v_arrayElimArr_4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((v_ArrVal_254 (Array Int Int))) (let ((.cse19 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse19 0) (= .cse19 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (= .cse19 |c_ULTIMATE.start_main_~p~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (let ((.cse20 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse21 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (not (= (select v_arrayElimArr_4 .cse20) 0)) (= .cse21 .cse20) (= .cse21 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |v_ULTIMATE.start_main_~p~0#1.base_39|)))))) (or .cse7 .cse8 (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (let ((.cse22 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (not (= .cse22 |c_ULTIMATE.start_main_~p~0#1.base|)) (= .cse22 |v_ULTIMATE.start_main_~p~0#1.base_39|)))) (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (let ((.cse23 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_4 .cse23) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse23))))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.offset|))) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |v_ULTIMATE.start_main_~p~0#1.base_39|)))) (forall ((v_arrayElimArr_4 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (not (= (select v_arrayElimArr_4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((v_ArrVal_254 (Array Int Int))) (let ((.cse24 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse24 0) (= .cse24 |c_ULTIMATE.start_main_~p~0#1.offset|)))))) .cse15 .cse17 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (let ((.cse25 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_4 .cse25) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse25))))) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|))))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))))))) is different from false [2022-07-12 03:14:59,602 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:14:59,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-12 03:14:59,607 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:14:59,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 42 [2022-07-12 03:14:59,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:14:59,611 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:14:59,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2022-07-12 03:14:59,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:14:59,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 54 [2022-07-12 03:14:59,619 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 39 treesize of output 31 [2022-07-12 03:14:59,622 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 34 treesize of output 26 [2022-07-12 03:14:59,625 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:14:59,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 11 [2022-07-12 03:14:59,641 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:14:59,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-12 03:14:59,647 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:14:59,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-07-12 03:14:59,657 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:14:59,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 86 [2022-07-12 03:14:59,662 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 66 treesize of output 58 [2022-07-12 03:14:59,669 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:14:59,669 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 67 treesize of output 71 [2022-07-12 03:14:59,700 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:14:59,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 73 [2022-07-12 03:14:59,707 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 54 treesize of output 46 [2022-07-12 03:14:59,713 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 24 treesize of output 20 [2022-07-12 03:14:59,835 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:14:59,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-07-12 03:14:59,841 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:14:59,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-07-12 03:14:59,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:14:59,845 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:14:59,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2022-07-12 03:14:59,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:14:59,850 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:14:59,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2022-07-12 03:14:59,854 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 7 treesize of output 3 [2022-07-12 03:14:59,857 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:14:59,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 8 [2022-07-12 03:14:59,869 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:14:59,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-07-12 03:14:59,874 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:14:59,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-07-12 03:14:59,878 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:14:59,888 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:14:59,888 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 1 case distinctions, treesize of input 36 treesize of output 39 [2022-07-12 03:14:59,892 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:14:59,899 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:14:59,900 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 1 case distinctions, treesize of input 36 treesize of output 39 [2022-07-12 03:14:59,908 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:14:59,908 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 20 treesize of output 24 [2022-07-12 03:14:59,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:14:59,942 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 03:14:59,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 1 [2022-07-12 03:14:59,947 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 03:14:59,948 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 1 [2022-07-12 03:14:59,953 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 03:14:59,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 1 [2022-07-12 03:14:59,959 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 03:14:59,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 1 [2022-07-12 03:14:59,966 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 03:14:59,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 1 [2022-07-12 03:15:00,189 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-07-12 03:15:00,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354467996] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:15:00,191 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:15:00,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 40 [2022-07-12 03:15:00,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803414717] [2022-07-12 03:15:00,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:15:00,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-12 03:15:00,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:15:00,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-12 03:15:00,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1109, Unknown=4, NotChecked=284, Total=1560 [2022-07-12 03:15:00,194 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 40 states, 40 states have (on average 2.0) internal successors, (80), 40 states have internal predecessors, (80), 0 states have call successors, (0), 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-12 03:15:00,282 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse34 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse2 (select .cse5 .cse34)) (.cse1 (select .cse0 .cse34)) (.cse3 (not .cse6)) (.cse4 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (= (select .cse0 4) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= .cse1 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse2 |c_ULTIMATE.start_main_~p~0#1.offset|) .cse3 (= .cse2 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~p~0#1.base|) 0)) .cse4 (= (select .cse5 4) |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse1 |c_ULTIMATE.start_main_~p~0#1.base|) (or (and (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) .cse6) (let ((.cse32 (= |c_ULTIMATE.start_main_~a~0#1.offset| (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))) (let ((.cse7 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (let ((.cse33 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse33 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse33 |v_ULTIMATE.start_main_~p~0#1.base_39|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|)))) (.cse8 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|)))) (.cse14 (and .cse32 .cse6)) (.cse13 (not .cse32))) (and (or (and .cse7 .cse8 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (let ((.cse10 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (.cse9 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_4 .cse9) 0)) (= .cse10 0) (not (= .cse10 .cse9))))) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (let ((.cse11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_4 .cse11) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse11))))) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((v_ArrVal_254 (Array Int Int))) (let ((.cse12 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse12 0) (= .cse12 |c_ULTIMATE.start_main_~p~0#1.offset|)))))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.offset|))) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |v_ULTIMATE.start_main_~p~0#1.base_39|))))) .cse13 .cse3) (or .cse14 (and .cse7 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((v_ArrVal_254 (Array Int Int))) (let ((.cse15 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse15 0) (= .cse15 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (= .cse15 |c_ULTIMATE.start_main_~p~0#1.offset|)))))) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|))) .cse8 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((v_ArrVal_254 (Array Int Int))) (let ((.cse16 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse16 0) (not (= .cse16 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))))) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (let ((.cse17 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_4 .cse17) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse17))))) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |v_ULTIMATE.start_main_~p~0#1.base_39|)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (let ((.cse18 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse19 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (not (= (select v_arrayElimArr_4 .cse18) 0)) (= .cse19 .cse18) (= .cse19 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |v_ULTIMATE.start_main_~p~0#1.base_39|)))))) (or (let ((.cse20 (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (let ((.cse31 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse31 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse31 |v_ULTIMATE.start_main_~p~0#1.base_39|))))) (.cse22 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|)))))) (and (or .cse14 (and .cse20 (forall ((v_arrayElimArr_4 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (not (= (select v_arrayElimArr_4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((v_ArrVal_254 (Array Int Int))) (let ((.cse21 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse21 0) (not (= .cse21 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))))) .cse22 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (let ((.cse23 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_4 .cse23) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse23))))) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |v_ULTIMATE.start_main_~p~0#1.base_39|)))) (forall ((v_arrayElimArr_4 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (not (= (select v_arrayElimArr_4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((v_ArrVal_254 (Array Int Int))) (let ((.cse24 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse24 0) (= .cse24 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (= .cse24 |c_ULTIMATE.start_main_~p~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (let ((.cse25 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse26 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (not (= (select v_arrayElimArr_4 .cse25) 0)) (= .cse26 .cse25) (= .cse26 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |v_ULTIMATE.start_main_~p~0#1.base_39|)))))) (or .cse13 .cse3 (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (let ((.cse27 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (not (= .cse27 |c_ULTIMATE.start_main_~p~0#1.base|)) (= .cse27 |v_ULTIMATE.start_main_~p~0#1.base_39|)))) (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (let ((.cse28 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_4 .cse28) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse28))))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.offset|))) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |v_ULTIMATE.start_main_~p~0#1.base_39|)))) (forall ((v_arrayElimArr_4 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (not (= (select v_arrayElimArr_4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((v_ArrVal_254 (Array Int Int))) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse29 0) (= .cse29 |c_ULTIMATE.start_main_~p~0#1.offset|)))))) .cse20 .cse22 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (let ((.cse30 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_4 .cse30) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse30))))) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|))))))))) .cse4)))))))) is different from false [2022-07-12 03:15:00,298 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse34 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse2 (select .cse5 .cse34)) (.cse1 (select .cse0 .cse34)) (.cse3 (not .cse6)) (.cse4 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (and (= (select .cse0 4) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= .cse1 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse2 |c_ULTIMATE.start_main_~p~0#1.offset|) .cse3 (= .cse2 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~p~0#1.base|) 0)) .cse4 (= (select .cse5 4) |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse1 |c_ULTIMATE.start_main_~p~0#1.base|) (or (and (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) .cse6) (let ((.cse32 (= |c_ULTIMATE.start_main_~a~0#1.offset| (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))) (let ((.cse7 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (let ((.cse33 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse33 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse33 |v_ULTIMATE.start_main_~p~0#1.base_39|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|)))) (.cse8 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|)))) (.cse14 (and .cse32 .cse6)) (.cse13 (not .cse32))) (and (or (and .cse7 .cse8 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (let ((.cse10 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (.cse9 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_4 .cse9) 0)) (= .cse10 0) (not (= .cse10 .cse9))))) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (let ((.cse11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_4 .cse11) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse11))))) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((v_ArrVal_254 (Array Int Int))) (let ((.cse12 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse12 0) (= .cse12 |c_ULTIMATE.start_main_~p~0#1.offset|)))))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.offset|))) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |v_ULTIMATE.start_main_~p~0#1.base_39|))))) .cse13 .cse3) (or .cse14 (and .cse7 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((v_ArrVal_254 (Array Int Int))) (let ((.cse15 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse15 0) (= .cse15 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (= .cse15 |c_ULTIMATE.start_main_~p~0#1.offset|)))))) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|))) .cse8 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((v_ArrVal_254 (Array Int Int))) (let ((.cse16 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse16 0) (not (= .cse16 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))))) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (let ((.cse17 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_4 .cse17) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse17))))) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |v_ULTIMATE.start_main_~p~0#1.base_39|)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (let ((.cse18 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse19 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (not (= (select v_arrayElimArr_4 .cse18) 0)) (= .cse19 .cse18) (= .cse19 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |v_ULTIMATE.start_main_~p~0#1.base_39|)))))) (or (let ((.cse20 (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (let ((.cse31 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse31 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse31 |v_ULTIMATE.start_main_~p~0#1.base_39|))))) (.cse22 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|)))))) (and (or .cse14 (and .cse20 (forall ((v_arrayElimArr_4 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (not (= (select v_arrayElimArr_4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((v_ArrVal_254 (Array Int Int))) (let ((.cse21 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse21 0) (not (= .cse21 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))))) .cse22 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (let ((.cse23 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_4 .cse23) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse23))))) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |v_ULTIMATE.start_main_~p~0#1.base_39|)))) (forall ((v_arrayElimArr_4 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (not (= (select v_arrayElimArr_4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((v_ArrVal_254 (Array Int Int))) (let ((.cse24 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse24 0) (= .cse24 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (= .cse24 |c_ULTIMATE.start_main_~p~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (let ((.cse25 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse26 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (not (= (select v_arrayElimArr_4 .cse25) 0)) (= .cse26 .cse25) (= .cse26 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |v_ULTIMATE.start_main_~p~0#1.base_39|)))))) (or .cse13 .cse3 (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (let ((.cse27 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (not (= .cse27 |c_ULTIMATE.start_main_~p~0#1.base|)) (= .cse27 |v_ULTIMATE.start_main_~p~0#1.base_39|)))) (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (let ((.cse28 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_4 .cse28) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse28))))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.offset|))) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |v_ULTIMATE.start_main_~p~0#1.base_39|)))) (forall ((v_arrayElimArr_4 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (not (= (select v_arrayElimArr_4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((v_ArrVal_254 (Array Int Int))) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse29 0) (= .cse29 |c_ULTIMATE.start_main_~p~0#1.offset|)))))) .cse20 .cse22 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (let ((.cse30 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_4 .cse30) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse30))))) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|))))))))) .cse4)))))))) is different from false [2022-07-12 03:15:00,309 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse8 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse9 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse7 (select .cse8 .cse9)) (.cse6 (select .cse5 .cse9))) (and (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_254 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int) (v_ArrVal_249 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse1 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 v_ArrVal_249)))) (store .cse4 |v_ULTIMATE.start_main_~p~0#1.base_39| (store (select .cse4 |v_ULTIMATE.start_main_~p~0#1.base_39|) 0 3))))) (let ((.cse0 (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 0)) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (or (= .cse0 3) (= .cse0 2) (not (= (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))))) (= (select .cse5 4) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= .cse6 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse7 |c_ULTIMATE.start_main_~p~0#1.offset|) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse7 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~p~0#1.base|) 0)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select .cse8 4) |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse6 |c_ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2022-07-12 03:15:00,315 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse8 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse9 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse2 (select .cse8 .cse9)) (.cse1 (select .cse0 .cse9))) (and (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~t~0#1.base|)) (= (select .cse0 4) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= .cse1 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse2 |c_ULTIMATE.start_main_~p~0#1.offset|) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= |c_ULTIMATE.start_main_~t~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~t~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse2 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_254 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int) (v_ArrVal_249 Int)) (let ((.cse6 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse3 (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse6 v_ArrVal_249)))) (store .cse7 |v_ULTIMATE.start_main_~p~0#1.base_39| (store (select .cse7 |v_ULTIMATE.start_main_~p~0#1.base_39|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))))) (let ((.cse4 (let ((.cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse3 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse6 |c_ULTIMATE.start_main_~t~0#1.offset|)) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))))) (or (not (= (select (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= 2 .cse4) (= 3 .cse4)))))) (= (select .cse8 4) |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse1 |c_ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2022-07-12 03:15:02,318 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse9 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse0 (select .cse6 .cse9)) (.cse1 (select .cse5 .cse9))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| .cse0) (+ .cse1 4)))) (and (= (select (select |c_#memory_int| .cse0) .cse1) 2) (= .cse2 0) (let ((.cse3 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (or (and (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) .cse3) (let ((.cse4 (select .cse6 4))) (and (not (= .cse4 |c_ULTIMATE.start_main_~p~0#1.base|)) (not .cse3) (= (select (select |c_#memory_int| .cse4) (select .cse5 4)) 2))))) (not (= .cse0 |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse2) (= .cse1 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (or (not (= (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (forall ((v_ArrVal_252 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (let ((.cse7 (let ((.cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))))) (or (= .cse7 3) (= .cse7 2)))))))))) is different from false [2022-07-12 03:15:02,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:15:02,701 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2022-07-12 03:15:02,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 03:15:02,701 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.0) internal successors, (80), 40 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-12 03:15:02,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:15:02,702 INFO L225 Difference]: With dead ends: 55 [2022-07-12 03:15:02,702 INFO L226 Difference]: Without dead ends: 53 [2022-07-12 03:15:02,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=240, Invalid=1593, Unknown=9, NotChecked=810, Total=2652 [2022-07-12 03:15:02,703 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 12 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:15:02,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 130 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 151 Invalid, 0 Unknown, 94 Unchecked, 0.1s Time] [2022-07-12 03:15:02,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-07-12 03:15:02,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-07-12 03:15:02,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 52 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-12 03:15:02,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2022-07-12 03:15:02,708 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 29 [2022-07-12 03:15:02,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:15:02,708 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2022-07-12 03:15:02,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.0) internal successors, (80), 40 states have internal predecessors, (80), 0 states have call successors, (0), 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-12 03:15:02,708 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-07-12 03:15:02,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 03:15:02,709 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:15:02,709 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:15:02,741 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-12 03:15:02,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:15:02,924 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:15:02,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:15:02,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1947572814, now seen corresponding path program 1 times [2022-07-12 03:15:02,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:15:02,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238145352] [2022-07-12 03:15:02,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:15:02,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:15:02,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:15:03,071 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 03:15:03,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:15:03,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238145352] [2022-07-12 03:15:03,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238145352] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:15:03,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930253090] [2022-07-12 03:15:03,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:15:03,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:15:03,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:15:03,073 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-12 03:15:03,075 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-12 03:15:03,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:15:03,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-12 03:15:03,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:15:03,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 03:15:03,207 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-12 03:15:03,237 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 03:15:03,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 03:15:03,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:15:03,277 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 21 treesize of output 20 [2022-07-12 03:15:03,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:15:03,348 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-12 03:15:03,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 03:15:03,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:15:03,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:15:03,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:15:03,506 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-12 03:15:03,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-07-12 03:15:03,617 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:15:03,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 14 [2022-07-12 03:15:03,620 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:15:03,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:15:05,133 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse0 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= 3 .cse0)))) is different from false [2022-07-12 03:15:05,148 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_370 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_48| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_370))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_48| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_48|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 3 .cse0) (= .cse0 1)))) is different from false [2022-07-12 03:15:05,157 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_370 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_48| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_370))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_48| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_48|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= 3 .cse0)))) is different from false [2022-07-12 03:15:05,173 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_370 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_48| Int) (v_ArrVal_367 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_367) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_370))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_48| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_48|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= .cse0 3)))) is different from false [2022-07-12 03:15:05,213 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~t~0#1.base_18| Int) (v_ArrVal_370 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_48| Int) (v_ArrVal_367 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_367) |v_ULTIMATE.start_main_~t~0#1.base_18| v_ArrVal_370))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_48| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_48|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_18|) 0)) (= .cse0 3) (= .cse0 1)))) is different from false [2022-07-12 03:15:05,342 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-12 03:15:05,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 73 [2022-07-12 03:15:05,360 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:05,361 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 4339 treesize of output 4233 [2022-07-12 03:15:05,389 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 4427 treesize of output 4171 [2022-07-12 03:15:05,502 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 4123 treesize of output 3995 [2022-07-12 03:15:05,599 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 6 treesize of output 4 [2022-07-12 03:15:05,941 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:05,942 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 2093 treesize of output 2035