./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0504.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0504.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cddde357ab55a506b6049f3b60959cd723bf2cbfd36f7774fe3606d53024bbf3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 18:38:36,461 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 18:38:36,462 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 18:38:36,496 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 18:38:36,497 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 18:38:36,498 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 18:38:36,502 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 18:38:36,507 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 18:38:36,509 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 18:38:36,513 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 18:38:36,514 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 18:38:36,516 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 18:38:36,516 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 18:38:36,518 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 18:38:36,520 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 18:38:36,521 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 18:38:36,521 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 18:38:36,523 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 18:38:36,526 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 18:38:36,531 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 18:38:36,533 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 18:38:36,533 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 18:38:36,534 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 18:38:36,535 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 18:38:36,536 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 18:38:36,543 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 18:38:36,543 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 18:38:36,544 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 18:38:36,545 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 18:38:36,545 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 18:38:36,546 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 18:38:36,546 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 18:38:36,548 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 18:38:36,548 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 18:38:36,549 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 18:38:36,550 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 18:38:36,551 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 18:38:36,551 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 18:38:36,551 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 18:38:36,552 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 18:38:36,552 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 18:38:36,554 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 18:38:36,556 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-12 18:38:36,589 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 18:38:36,589 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 18:38:36,590 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 18:38:36,590 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 18:38:36,590 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 18:38:36,591 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 18:38:36,591 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 18:38:36,591 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 18:38:36,591 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 18:38:36,592 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 18:38:36,592 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 18:38:36,593 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 18:38:36,593 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 18:38:36,593 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 18:38:36,593 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 18:38:36,593 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 18:38:36,593 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 18:38:36,594 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 18:38:36,594 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 18:38:36,594 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 18:38:36,595 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 18:38:36,595 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 18:38:36,595 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 18:38:36,596 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 18:38:36,596 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 18:38:36,596 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:38:36,596 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 18:38:36,596 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 18:38:36,597 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 18:38:36,597 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 18:38:36,597 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> cddde357ab55a506b6049f3b60959cd723bf2cbfd36f7774fe3606d53024bbf3 [2022-07-12 18:38:36,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 18:38:36,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 18:38:36,854 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 18:38:36,855 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 18:38:36,856 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 18:38:36,857 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0504.i [2022-07-12 18:38:36,917 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c421e6586/53ee37cb827d46c4893f8aa417321def/FLAG87f31adff [2022-07-12 18:38:37,371 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 18:38:37,371 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0504.i [2022-07-12 18:38:37,383 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c421e6586/53ee37cb827d46c4893f8aa417321def/FLAG87f31adff [2022-07-12 18:38:37,745 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c421e6586/53ee37cb827d46c4893f8aa417321def [2022-07-12 18:38:37,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 18:38:37,748 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 18:38:37,752 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 18:38:37,752 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 18:38:37,758 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 18:38:37,759 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:38:37" (1/1) ... [2022-07-12 18:38:37,760 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bd22936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:38:37, skipping insertion in model container [2022-07-12 18:38:37,760 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:38:37" (1/1) ... [2022-07-12 18:38:37,766 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 18:38:37,802 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 18:38:38,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:38:38,062 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 18:38:38,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:38:38,152 INFO L208 MainTranslator]: Completed translation [2022-07-12 18:38:38,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:38:38 WrapperNode [2022-07-12 18:38:38,153 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 18:38:38,154 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 18:38:38,154 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 18:38:38,155 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 18:38:38,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:38:38" (1/1) ... [2022-07-12 18:38:38,184 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:38:38" (1/1) ... [2022-07-12 18:38:38,202 INFO L137 Inliner]: procedures = 123, calls = 27, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 86 [2022-07-12 18:38:38,202 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 18:38:38,203 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 18:38:38,203 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 18:38:38,203 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 18:38:38,210 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:38:38" (1/1) ... [2022-07-12 18:38:38,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:38:38" (1/1) ... [2022-07-12 18:38:38,213 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:38:38" (1/1) ... [2022-07-12 18:38:38,213 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:38:38" (1/1) ... [2022-07-12 18:38:38,220 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:38:38" (1/1) ... [2022-07-12 18:38:38,223 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:38:38" (1/1) ... [2022-07-12 18:38:38,231 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:38:38" (1/1) ... [2022-07-12 18:38:38,233 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 18:38:38,234 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 18:38:38,234 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 18:38:38,234 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 18:38:38,235 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:38:38" (1/1) ... [2022-07-12 18:38:38,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:38:38,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:38:38,266 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 18:38:38,268 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 18:38:38,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 18:38:38,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 18:38:38,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 18:38:38,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 18:38:38,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 18:38:38,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 18:38:38,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 18:38:38,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 18:38:38,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 18:38:38,370 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 18:38:38,371 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 18:38:38,705 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 18:38:38,713 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 18:38:38,713 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-12 18:38:38,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:38:38 BoogieIcfgContainer [2022-07-12 18:38:38,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 18:38:38,717 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 18:38:38,717 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 18:38:38,720 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 18:38:38,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 06:38:37" (1/3) ... [2022-07-12 18:38:38,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7073f495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:38:38, skipping insertion in model container [2022-07-12 18:38:38,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:38:38" (2/3) ... [2022-07-12 18:38:38,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7073f495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:38:38, skipping insertion in model container [2022-07-12 18:38:38,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:38:38" (3/3) ... [2022-07-12 18:38:38,722 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0504.i [2022-07-12 18:38:38,734 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 18:38:38,735 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2022-07-12 18:38:38,788 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 18:38:38,796 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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@3ad9f339, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@143f8f58 [2022-07-12 18:38:38,797 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2022-07-12 18:38:38,801 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 45 states have (on average 2.1555555555555554) internal successors, (97), 86 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:38,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-12 18:38:38,812 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:38,812 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-12 18:38:38,813 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:38:38,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:38,819 INFO L85 PathProgramCache]: Analyzing trace with hash 28780379, now seen corresponding path program 1 times [2022-07-12 18:38:38,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:38,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609522886] [2022-07-12 18:38:38,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:38,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:38,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:38,926 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 18:38:38,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:38,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609522886] [2022-07-12 18:38:38,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609522886] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:38,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:38,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:38:38,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633689690] [2022-07-12 18:38:38,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:38,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 18:38:38,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:38,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 18:38:38,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 18:38:38,957 INFO L87 Difference]: Start difference. First operand has 87 states, 45 states have (on average 2.1555555555555554) internal successors, (97), 86 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 18:38:38,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:38,979 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2022-07-12 18:38:38,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 18:38:38,981 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-07-12 18:38:38,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:38,989 INFO L225 Difference]: With dead ends: 87 [2022-07-12 18:38:38,989 INFO L226 Difference]: Without dead ends: 85 [2022-07-12 18:38:38,991 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 18:38:38,995 INFO L413 NwaCegarLoop]: 91 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, 91 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 18:38:39,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:38:39,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-12 18:38:39,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-07-12 18:38:39,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 44 states have (on average 2.022727272727273) internal successors, (89), 84 states have internal predecessors, (89), 0 states have call successors, (0), 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 18:38:39,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2022-07-12 18:38:39,035 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 5 [2022-07-12 18:38:39,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:39,035 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2022-07-12 18:38:39,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 18:38:39,036 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2022-07-12 18:38:39,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 18:38:39,036 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:39,036 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 18:38:39,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 18:38:39,037 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:38:39,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:39,038 INFO L85 PathProgramCache]: Analyzing trace with hash 889572104, now seen corresponding path program 1 times [2022-07-12 18:38:39,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:39,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117498778] [2022-07-12 18:38:39,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:39,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:39,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:39,103 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 18:38:39,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:39,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117498778] [2022-07-12 18:38:39,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117498778] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:39,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:39,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:38:39,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658090703] [2022-07-12 18:38:39,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:39,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:38:39,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:39,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:38:39,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:38:39,108 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 18:38:39,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:39,152 INFO L93 Difference]: Finished difference Result 133 states and 139 transitions. [2022-07-12 18:38:39,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:38:39,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-07-12 18:38:39,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:39,156 INFO L225 Difference]: With dead ends: 133 [2022-07-12 18:38:39,157 INFO L226 Difference]: Without dead ends: 133 [2022-07-12 18:38:39,158 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 18:38:39,160 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 49 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:39,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 165 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:38:39,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-07-12 18:38:39,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 109. [2022-07-12 18:38:39,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 68 states have (on average 2.0441176470588234) internal successors, (139), 108 states have internal predecessors, (139), 0 states have call successors, (0), 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 18:38:39,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 139 transitions. [2022-07-12 18:38:39,178 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 139 transitions. Word has length 6 [2022-07-12 18:38:39,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:39,179 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 139 transitions. [2022-07-12 18:38:39,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 18:38:39,179 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 139 transitions. [2022-07-12 18:38:39,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 18:38:39,180 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:39,180 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 18:38:39,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 18:38:39,180 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:38:39,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:39,181 INFO L85 PathProgramCache]: Analyzing trace with hash 889571339, now seen corresponding path program 1 times [2022-07-12 18:38:39,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:39,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063312678] [2022-07-12 18:38:39,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:39,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:39,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:39,248 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 18:38:39,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:39,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063312678] [2022-07-12 18:38:39,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063312678] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:39,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:39,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:38:39,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318973600] [2022-07-12 18:38:39,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:39,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:38:39,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:39,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:38:39,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:38:39,254 INFO L87 Difference]: Start difference. First operand 109 states and 139 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 18:38:39,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:39,352 INFO L93 Difference]: Finished difference Result 130 states and 154 transitions. [2022-07-12 18:38:39,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:38:39,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-07-12 18:38:39,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:39,356 INFO L225 Difference]: With dead ends: 130 [2022-07-12 18:38:39,356 INFO L226 Difference]: Without dead ends: 130 [2022-07-12 18:38:39,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 18:38:39,359 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 74 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:39,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 64 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:38:39,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-12 18:38:39,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 101. [2022-07-12 18:38:39,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 68 states have (on average 1.8235294117647058) internal successors, (124), 100 states have internal predecessors, (124), 0 states have call successors, (0), 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 18:38:39,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 124 transitions. [2022-07-12 18:38:39,367 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 124 transitions. Word has length 6 [2022-07-12 18:38:39,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:39,367 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 124 transitions. [2022-07-12 18:38:39,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 18:38:39,367 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 124 transitions. [2022-07-12 18:38:39,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 18:38:39,368 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:39,368 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 18:38:39,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 18:38:39,369 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:38:39,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:39,369 INFO L85 PathProgramCache]: Analyzing trace with hash 889571340, now seen corresponding path program 1 times [2022-07-12 18:38:39,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:39,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77424024] [2022-07-12 18:38:39,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:39,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:39,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:39,416 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 18:38:39,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:39,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77424024] [2022-07-12 18:38:39,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77424024] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:39,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:39,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:38:39,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121041169] [2022-07-12 18:38:39,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:39,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:38:39,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:39,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:38:39,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:38:39,419 INFO L87 Difference]: Start difference. First operand 101 states and 124 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 18:38:39,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:39,489 INFO L93 Difference]: Finished difference Result 138 states and 161 transitions. [2022-07-12 18:38:39,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:38:39,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-07-12 18:38:39,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:39,491 INFO L225 Difference]: With dead ends: 138 [2022-07-12 18:38:39,491 INFO L226 Difference]: Without dead ends: 138 [2022-07-12 18:38:39,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 18:38:39,501 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 47 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:39,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 102 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:38:39,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-07-12 18:38:39,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 101. [2022-07-12 18:38:39,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 73 states have (on average 1.6849315068493151) internal successors, (123), 100 states have internal predecessors, (123), 0 states have call successors, (0), 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 18:38:39,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2022-07-12 18:38:39,515 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 6 [2022-07-12 18:38:39,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:39,516 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2022-07-12 18:38:39,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 18:38:39,516 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2022-07-12 18:38:39,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 18:38:39,517 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:39,517 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:38:39,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 18:38:39,524 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:38:39,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:39,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1806930847, now seen corresponding path program 1 times [2022-07-12 18:38:39,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:39,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302318700] [2022-07-12 18:38:39,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:39,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:39,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:39,577 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 18:38:39,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:39,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302318700] [2022-07-12 18:38:39,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302318700] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:39,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:39,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:38:39,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934682750] [2022-07-12 18:38:39,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:39,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:38:39,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:39,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:38:39,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:38:39,579 INFO L87 Difference]: Start difference. First operand 101 states and 123 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 18:38:39,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:39,623 INFO L93 Difference]: Finished difference Result 103 states and 124 transitions. [2022-07-12 18:38:39,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:38:39,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-07-12 18:38:39,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:39,626 INFO L225 Difference]: With dead ends: 103 [2022-07-12 18:38:39,626 INFO L226 Difference]: Without dead ends: 100 [2022-07-12 18:38:39,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 18:38:39,627 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:39,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:38:39,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-12 18:38:39,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-07-12 18:38:39,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.6805555555555556) internal successors, (121), 99 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:39,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 121 transitions. [2022-07-12 18:38:39,646 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 121 transitions. Word has length 7 [2022-07-12 18:38:39,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:39,647 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 121 transitions. [2022-07-12 18:38:39,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 18:38:39,649 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 121 transitions. [2022-07-12 18:38:39,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 18:38:39,650 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:39,651 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:38:39,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 18:38:39,652 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:38:39,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:39,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1857997403, now seen corresponding path program 1 times [2022-07-12 18:38:39,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:39,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573302377] [2022-07-12 18:38:39,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:39,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:39,822 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 18:38:39,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:39,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573302377] [2022-07-12 18:38:39,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573302377] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:39,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:39,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:38:39,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78920995] [2022-07-12 18:38:39,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:39,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:38:39,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:39,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:38:39,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:38:39,824 INFO L87 Difference]: Start difference. First operand 100 states and 121 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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 18:38:39,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:39,944 INFO L93 Difference]: Finished difference Result 126 states and 146 transitions. [2022-07-12 18:38:39,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:38:39,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-07-12 18:38:39,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:39,946 INFO L225 Difference]: With dead ends: 126 [2022-07-12 18:38:39,946 INFO L226 Difference]: Without dead ends: 126 [2022-07-12 18:38:39,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:38:39,947 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 117 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:39,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 69 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:38:39,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-12 18:38:39,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 92. [2022-07-12 18:38:39,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 67 states have (on average 1.5970149253731343) internal successors, (107), 91 states have internal predecessors, (107), 0 states have call successors, (0), 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 18:38:39,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 107 transitions. [2022-07-12 18:38:39,969 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 107 transitions. Word has length 15 [2022-07-12 18:38:39,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:39,970 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 107 transitions. [2022-07-12 18:38:39,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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 18:38:39,970 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 107 transitions. [2022-07-12 18:38:39,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 18:38:39,971 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:39,971 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:38:39,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 18:38:39,971 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:38:39,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:39,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1763344638, now seen corresponding path program 1 times [2022-07-12 18:38:39,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:39,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5222824] [2022-07-12 18:38:39,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:39,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:40,031 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 18:38:40,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:40,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5222824] [2022-07-12 18:38:40,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5222824] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:40,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:40,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:38:40,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491457469] [2022-07-12 18:38:40,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:40,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:38:40,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:40,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:38:40,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:38:40,033 INFO L87 Difference]: Start difference. First operand 92 states and 107 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:40,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:40,078 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2022-07-12 18:38:40,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:38:40,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-12 18:38:40,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:40,079 INFO L225 Difference]: With dead ends: 88 [2022-07-12 18:38:40,079 INFO L226 Difference]: Without dead ends: 88 [2022-07-12 18:38:40,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 18:38:40,080 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 14 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:40,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 84 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:38:40,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-12 18:38:40,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-07-12 18:38:40,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 67 states have (on average 1.4776119402985075) internal successors, (99), 87 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:40,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2022-07-12 18:38:40,089 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 16 [2022-07-12 18:38:40,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:40,089 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2022-07-12 18:38:40,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:40,090 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2022-07-12 18:38:40,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 18:38:40,091 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:40,091 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:38:40,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 18:38:40,092 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:38:40,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:40,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1763344639, now seen corresponding path program 1 times [2022-07-12 18:38:40,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:40,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163065374] [2022-07-12 18:38:40,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:40,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:40,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:40,160 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 18:38:40,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:40,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163065374] [2022-07-12 18:38:40,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163065374] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:40,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:40,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:38:40,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408019842] [2022-07-12 18:38:40,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:40,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:38:40,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:40,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:38:40,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:38:40,163 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:40,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:40,195 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2022-07-12 18:38:40,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:38:40,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-12 18:38:40,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:40,197 INFO L225 Difference]: With dead ends: 84 [2022-07-12 18:38:40,197 INFO L226 Difference]: Without dead ends: 84 [2022-07-12 18:38:40,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 18:38:40,198 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 10 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:40,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 89 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:38:40,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-07-12 18:38:40,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-07-12 18:38:40,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 83 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:40,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2022-07-12 18:38:40,206 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 16 [2022-07-12 18:38:40,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:40,206 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2022-07-12 18:38:40,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:40,207 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2022-07-12 18:38:40,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 18:38:40,208 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:40,208 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 18:38:40,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 18:38:40,211 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:38:40,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:40,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1967864768, now seen corresponding path program 1 times [2022-07-12 18:38:40,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:40,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012583098] [2022-07-12 18:38:40,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:40,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:40,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:40,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:40,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:40,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012583098] [2022-07-12 18:38:40,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012583098] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:40,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:40,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:38:40,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187611792] [2022-07-12 18:38:40,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:40,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:38:40,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:40,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:38:40,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:38:40,305 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 18:38:40,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:40,399 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2022-07-12 18:38:40,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:38:40,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 18:38:40,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:40,400 INFO L225 Difference]: With dead ends: 114 [2022-07-12 18:38:40,400 INFO L226 Difference]: Without dead ends: 114 [2022-07-12 18:38:40,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:38:40,403 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 83 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:40,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 84 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:38:40,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-12 18:38:40,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 86. [2022-07-12 18:38:40,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 69 states have (on average 1.3768115942028984) internal successors, (95), 85 states have internal predecessors, (95), 0 states have call successors, (0), 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 18:38:40,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2022-07-12 18:38:40,406 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 18 [2022-07-12 18:38:40,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:40,409 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2022-07-12 18:38:40,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 18:38:40,409 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2022-07-12 18:38:40,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 18:38:40,410 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:40,410 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 18:38:40,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 18:38:40,411 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:38:40,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:40,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1967864767, now seen corresponding path program 1 times [2022-07-12 18:38:40,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:40,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301880071] [2022-07-12 18:38:40,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:40,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:40,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:40,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:40,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:40,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301880071] [2022-07-12 18:38:40,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301880071] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:40,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:40,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:38:40,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451872933] [2022-07-12 18:38:40,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:40,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:38:40,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:40,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:38:40,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:38:40,485 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 18:38:40,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:40,575 INFO L93 Difference]: Finished difference Result 153 states and 172 transitions. [2022-07-12 18:38:40,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:38:40,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 18:38:40,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:40,576 INFO L225 Difference]: With dead ends: 153 [2022-07-12 18:38:40,576 INFO L226 Difference]: Without dead ends: 153 [2022-07-12 18:38:40,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:38:40,577 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 72 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:40,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 118 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:38:40,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-12 18:38:40,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 109. [2022-07-12 18:38:40,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 92 states have (on average 1.3804347826086956) internal successors, (127), 108 states have internal predecessors, (127), 0 states have call successors, (0), 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 18:38:40,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 127 transitions. [2022-07-12 18:38:40,585 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 127 transitions. Word has length 18 [2022-07-12 18:38:40,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:40,585 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 127 transitions. [2022-07-12 18:38:40,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 18:38:40,586 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 127 transitions. [2022-07-12 18:38:40,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 18:38:40,587 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:40,587 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:38:40,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 18:38:40,588 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:38:40,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:40,589 INFO L85 PathProgramCache]: Analyzing trace with hash -874266265, now seen corresponding path program 1 times [2022-07-12 18:38:40,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:40,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974640595] [2022-07-12 18:38:40,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:40,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:40,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:40,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:40,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:40,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974640595] [2022-07-12 18:38:40,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974640595] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:40,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:40,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:38:40,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422209563] [2022-07-12 18:38:40,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:40,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:38:40,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:40,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:38:40,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:38:40,645 INFO L87 Difference]: Start difference. First operand 109 states and 127 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:40,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:40,693 INFO L93 Difference]: Finished difference Result 113 states and 123 transitions. [2022-07-12 18:38:40,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:38:40,693 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-12 18:38:40,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:40,694 INFO L225 Difference]: With dead ends: 113 [2022-07-12 18:38:40,694 INFO L226 Difference]: Without dead ends: 113 [2022-07-12 18:38:40,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:38:40,696 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 89 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:40,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 108 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:38:40,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-12 18:38:40,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 106. [2022-07-12 18:38:40,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 105 states have internal predecessors, (118), 0 states have call successors, (0), 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 18:38:40,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 118 transitions. [2022-07-12 18:38:40,700 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 118 transitions. Word has length 19 [2022-07-12 18:38:40,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:40,701 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 118 transitions. [2022-07-12 18:38:40,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:40,702 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 118 transitions. [2022-07-12 18:38:40,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 18:38:40,703 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:40,704 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:38:40,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 18:38:40,704 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:38:40,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:40,705 INFO L85 PathProgramCache]: Analyzing trace with hash 55140128, now seen corresponding path program 1 times [2022-07-12 18:38:40,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:40,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042577417] [2022-07-12 18:38:40,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:40,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:40,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:40,786 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 18:38:40,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:40,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042577417] [2022-07-12 18:38:40,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042577417] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:40,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:40,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:38:40,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068565553] [2022-07-12 18:38:40,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:40,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:38:40,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:40,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:38:40,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:38:40,789 INFO L87 Difference]: Start difference. First operand 106 states and 118 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:40,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:40,916 INFO L93 Difference]: Finished difference Result 170 states and 187 transitions. [2022-07-12 18:38:40,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:38:40,917 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-12 18:38:40,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:40,917 INFO L225 Difference]: With dead ends: 170 [2022-07-12 18:38:40,917 INFO L226 Difference]: Without dead ends: 170 [2022-07-12 18:38:40,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:38:40,918 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 43 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:40,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 183 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:38:40,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-07-12 18:38:40,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 120. [2022-07-12 18:38:40,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 119 states have internal predecessors, (135), 0 states have call successors, (0), 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 18:38:40,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 135 transitions. [2022-07-12 18:38:40,921 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 135 transitions. Word has length 19 [2022-07-12 18:38:40,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:40,921 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 135 transitions. [2022-07-12 18:38:40,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:40,922 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 135 transitions. [2022-07-12 18:38:40,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 18:38:40,922 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:40,922 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:38:40,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 18:38:40,922 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:38:40,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:40,923 INFO L85 PathProgramCache]: Analyzing trace with hash 55140129, now seen corresponding path program 1 times [2022-07-12 18:38:40,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:40,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654874142] [2022-07-12 18:38:40,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:40,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:40,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:41,068 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 18:38:41,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:41,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654874142] [2022-07-12 18:38:41,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654874142] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:41,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:41,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 18:38:41,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147141778] [2022-07-12 18:38:41,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:41,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 18:38:41,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:41,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 18:38:41,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:38:41,071 INFO L87 Difference]: Start difference. First operand 120 states and 135 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:41,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:41,361 INFO L93 Difference]: Finished difference Result 184 states and 199 transitions. [2022-07-12 18:38:41,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 18:38:41,361 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-12 18:38:41,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:41,362 INFO L225 Difference]: With dead ends: 184 [2022-07-12 18:38:41,362 INFO L226 Difference]: Without dead ends: 184 [2022-07-12 18:38:41,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2022-07-12 18:38:41,363 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 162 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:41,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 195 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:38:41,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-07-12 18:38:41,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 120. [2022-07-12 18:38:41,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 103 states have (on average 1.2912621359223302) internal successors, (133), 119 states have internal predecessors, (133), 0 states have call successors, (0), 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 18:38:41,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 133 transitions. [2022-07-12 18:38:41,367 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 133 transitions. Word has length 19 [2022-07-12 18:38:41,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:41,367 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 133 transitions. [2022-07-12 18:38:41,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:41,368 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 133 transitions. [2022-07-12 18:38:41,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 18:38:41,368 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:41,368 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:38:41,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 18:38:41,369 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:38:41,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:41,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1332429407, now seen corresponding path program 1 times [2022-07-12 18:38:41,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:41,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784416242] [2022-07-12 18:38:41,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:41,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:41,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 18:38:41,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:41,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784416242] [2022-07-12 18:38:41,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784416242] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:41,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:41,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:38:41,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113459589] [2022-07-12 18:38:41,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:41,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:38:41,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:41,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:38:41,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:38:41,407 INFO L87 Difference]: Start difference. First operand 120 states and 133 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:41,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:41,477 INFO L93 Difference]: Finished difference Result 135 states and 149 transitions. [2022-07-12 18:38:41,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:38:41,478 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-12 18:38:41,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:41,479 INFO L225 Difference]: With dead ends: 135 [2022-07-12 18:38:41,479 INFO L226 Difference]: Without dead ends: 135 [2022-07-12 18:38:41,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:38:41,480 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 21 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:41,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 98 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:38:41,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-12 18:38:41,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 123. [2022-07-12 18:38:41,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 107 states have (on average 1.2990654205607477) internal successors, (139), 122 states have internal predecessors, (139), 0 states have call successors, (0), 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 18:38:41,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 139 transitions. [2022-07-12 18:38:41,484 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 139 transitions. Word has length 20 [2022-07-12 18:38:41,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:41,485 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 139 transitions. [2022-07-12 18:38:41,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:41,485 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 139 transitions. [2022-07-12 18:38:41,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 18:38:41,487 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:41,487 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:38:41,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 18:38:41,487 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:38:41,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:41,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1332429406, now seen corresponding path program 1 times [2022-07-12 18:38:41,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:41,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450887634] [2022-07-12 18:38:41,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:41,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:41,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:41,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:41,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:41,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450887634] [2022-07-12 18:38:41,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450887634] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:41,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:41,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:38:41,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776354304] [2022-07-12 18:38:41,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:41,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:38:41,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:41,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:38:41,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:38:41,563 INFO L87 Difference]: Start difference. First operand 123 states and 139 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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 18:38:41,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:41,699 INFO L93 Difference]: Finished difference Result 194 states and 217 transitions. [2022-07-12 18:38:41,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:38:41,700 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-12 18:38:41,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:41,701 INFO L225 Difference]: With dead ends: 194 [2022-07-12 18:38:41,701 INFO L226 Difference]: Without dead ends: 194 [2022-07-12 18:38:41,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:38:41,702 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 111 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:41,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 132 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:38:41,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-07-12 18:38:41,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 135. [2022-07-12 18:38:41,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 119 states have (on average 1.3277310924369747) internal successors, (158), 134 states have internal predecessors, (158), 0 states have call successors, (0), 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 18:38:41,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 158 transitions. [2022-07-12 18:38:41,705 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 158 transitions. Word has length 20 [2022-07-12 18:38:41,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:41,705 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 158 transitions. [2022-07-12 18:38:41,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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 18:38:41,705 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 158 transitions. [2022-07-12 18:38:41,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 18:38:41,706 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:41,706 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:38:41,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 18:38:41,706 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:38:41,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:41,706 INFO L85 PathProgramCache]: Analyzing trace with hash -316635569, now seen corresponding path program 1 times [2022-07-12 18:38:41,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:41,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836877378] [2022-07-12 18:38:41,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:41,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:41,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:41,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:41,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:41,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836877378] [2022-07-12 18:38:41,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836877378] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:41,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:41,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 18:38:41,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852581275] [2022-07-12 18:38:41,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:41,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:38:41,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:41,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:38:41,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:38:41,766 INFO L87 Difference]: Start difference. First operand 135 states and 158 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 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 18:38:41,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:41,956 INFO L93 Difference]: Finished difference Result 200 states and 231 transitions. [2022-07-12 18:38:41,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 18:38:41,957 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-12 18:38:41,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:41,958 INFO L225 Difference]: With dead ends: 200 [2022-07-12 18:38:41,958 INFO L226 Difference]: Without dead ends: 200 [2022-07-12 18:38:41,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2022-07-12 18:38:41,958 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 83 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:41,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 225 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:38:41,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-07-12 18:38:41,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 144. [2022-07-12 18:38:41,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 128 states have (on average 1.328125) internal successors, (170), 143 states have internal predecessors, (170), 0 states have call successors, (0), 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 18:38:41,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 170 transitions. [2022-07-12 18:38:41,962 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 170 transitions. Word has length 23 [2022-07-12 18:38:41,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:41,962 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 170 transitions. [2022-07-12 18:38:41,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 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 18:38:41,962 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 170 transitions. [2022-07-12 18:38:41,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 18:38:41,962 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:41,963 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:38:41,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 18:38:41,963 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:38:41,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:41,963 INFO L85 PathProgramCache]: Analyzing trace with hash -316635568, now seen corresponding path program 1 times [2022-07-12 18:38:41,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:41,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219971954] [2022-07-12 18:38:41,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:41,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:41,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:42,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:42,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:42,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219971954] [2022-07-12 18:38:42,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219971954] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:42,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:42,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 18:38:42,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129637250] [2022-07-12 18:38:42,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:42,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:38:42,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:42,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:38:42,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:38:42,054 INFO L87 Difference]: Start difference. First operand 144 states and 170 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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 18:38:42,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:42,224 INFO L93 Difference]: Finished difference Result 195 states and 225 transitions. [2022-07-12 18:38:42,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 18:38:42,225 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-12 18:38:42,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:42,226 INFO L225 Difference]: With dead ends: 195 [2022-07-12 18:38:42,226 INFO L226 Difference]: Without dead ends: 195 [2022-07-12 18:38:42,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-07-12 18:38:42,227 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 93 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:42,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 236 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:38:42,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-07-12 18:38:42,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 143. [2022-07-12 18:38:42,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 127 states have (on average 1.31496062992126) internal successors, (167), 142 states have internal predecessors, (167), 0 states have call successors, (0), 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 18:38:42,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 167 transitions. [2022-07-12 18:38:42,230 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 167 transitions. Word has length 23 [2022-07-12 18:38:42,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:42,230 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 167 transitions. [2022-07-12 18:38:42,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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 18:38:42,230 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 167 transitions. [2022-07-12 18:38:42,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 18:38:42,230 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:42,231 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:38:42,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 18:38:42,231 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:38:42,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:42,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1225769432, now seen corresponding path program 1 times [2022-07-12 18:38:42,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:42,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877194542] [2022-07-12 18:38:42,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:42,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:42,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:42,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:42,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:42,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877194542] [2022-07-12 18:38:42,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877194542] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:42,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:42,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:38:42,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66499018] [2022-07-12 18:38:42,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:42,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:38:42,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:42,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:38:42,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:38:42,273 INFO L87 Difference]: Start difference. First operand 143 states and 167 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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 18:38:42,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:42,371 INFO L93 Difference]: Finished difference Result 167 states and 191 transitions. [2022-07-12 18:38:42,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:38:42,372 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-12 18:38:42,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:42,373 INFO L225 Difference]: With dead ends: 167 [2022-07-12 18:38:42,373 INFO L226 Difference]: Without dead ends: 167 [2022-07-12 18:38:42,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:38:42,373 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 112 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:42,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 148 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:38:42,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-12 18:38:42,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 157. [2022-07-12 18:38:42,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 141 states have (on average 1.3546099290780143) internal successors, (191), 156 states have internal predecessors, (191), 0 states have call successors, (0), 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 18:38:42,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 191 transitions. [2022-07-12 18:38:42,377 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 191 transitions. Word has length 24 [2022-07-12 18:38:42,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:42,377 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 191 transitions. [2022-07-12 18:38:42,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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 18:38:42,377 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 191 transitions. [2022-07-12 18:38:42,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 18:38:42,378 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:42,378 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:38:42,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 18:38:42,378 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:38:42,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:42,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1085033438, now seen corresponding path program 1 times [2022-07-12 18:38:42,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:42,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068958667] [2022-07-12 18:38:42,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:42,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:42,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:42,507 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:42,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:42,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068958667] [2022-07-12 18:38:42,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068958667] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:38:42,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428517598] [2022-07-12 18:38:42,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:42,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:38:42,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:38:42,515 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 18:38:42,544 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 18:38:42,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:42,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-12 18:38:42,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:38:42,715 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 18:38:42,727 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 18:38:42,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:38:42,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 18:38:42,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:38:42,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 18:38:42,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:38:42,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:38:42,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:38:42,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:38:42,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:38:42,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 18:38:42,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:38:42,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 18:38:42,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:38:42,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 18:38:42,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:38:42,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 18:38:42,922 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 18:38:42,925 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 18:38:42,946 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:42,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:38:43,031 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:43,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428517598] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:38:43,031 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:38:43,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 9 [2022-07-12 18:38:43,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468918335] [2022-07-12 18:38:43,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:38:43,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 18:38:43,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:43,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 18:38:43,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:38:43,033 INFO L87 Difference]: Start difference. First operand 157 states and 191 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:43,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:43,217 INFO L93 Difference]: Finished difference Result 186 states and 218 transitions. [2022-07-12 18:38:43,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 18:38:43,218 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-12 18:38:43,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:43,218 INFO L225 Difference]: With dead ends: 186 [2022-07-12 18:38:43,218 INFO L226 Difference]: Without dead ends: 186 [2022-07-12 18:38:43,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-07-12 18:38:43,219 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 199 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:43,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 267 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:38:43,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-07-12 18:38:43,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 161. [2022-07-12 18:38:43,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 145 states have (on average 1.3448275862068966) internal successors, (195), 160 states have internal predecessors, (195), 0 states have call successors, (0), 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 18:38:43,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 195 transitions. [2022-07-12 18:38:43,223 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 195 transitions. Word has length 27 [2022-07-12 18:38:43,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:43,223 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 195 transitions. [2022-07-12 18:38:43,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:43,224 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 195 transitions. [2022-07-12 18:38:43,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 18:38:43,224 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:43,224 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-07-12 18:38:43,251 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 18:38:43,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:38:43,425 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:38:43,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:43,426 INFO L85 PathProgramCache]: Analyzing trace with hash 2078846143, now seen corresponding path program 1 times [2022-07-12 18:38:43,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:43,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826244315] [2022-07-12 18:38:43,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:43,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:43,478 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:43,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:43,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826244315] [2022-07-12 18:38:43,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826244315] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:38:43,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480548308] [2022-07-12 18:38:43,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:43,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:38:43,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:38:43,484 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 18:38:43,491 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 18:38:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:43,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 18:38:43,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:38:43,614 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 18:38:43,651 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 18:38:43,651 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 18:38:43,671 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:43,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:38:43,775 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:43,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480548308] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:38:43,776 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:38:43,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2022-07-12 18:38:43,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252333763] [2022-07-12 18:38:43,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:38:43,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:38:43,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:43,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:38:43,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:38:43,777 INFO L87 Difference]: Start difference. First operand 161 states and 195 transitions. Second operand has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:43,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:43,845 INFO L93 Difference]: Finished difference Result 181 states and 214 transitions. [2022-07-12 18:38:43,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:38:43,845 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-12 18:38:43,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:43,846 INFO L225 Difference]: With dead ends: 181 [2022-07-12 18:38:43,846 INFO L226 Difference]: Without dead ends: 181 [2022-07-12 18:38:43,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:38:43,847 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 137 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:43,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 141 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 47 Unchecked, 0.1s Time] [2022-07-12 18:38:43,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-07-12 18:38:43,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 160. [2022-07-12 18:38:43,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 145 states have (on average 1.3310344827586207) internal successors, (193), 159 states have internal predecessors, (193), 0 states have call successors, (0), 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 18:38:43,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 193 transitions. [2022-07-12 18:38:43,851 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 193 transitions. Word has length 27 [2022-07-12 18:38:43,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:43,851 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 193 transitions. [2022-07-12 18:38:43,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:43,851 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 193 transitions. [2022-07-12 18:38:43,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 18:38:43,852 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:43,852 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-07-12 18:38:43,878 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 18:38:44,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2022-07-12 18:38:44,066 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:38:44,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:44,067 INFO L85 PathProgramCache]: Analyzing trace with hash 2078846144, now seen corresponding path program 1 times [2022-07-12 18:38:44,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:44,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708178577] [2022-07-12 18:38:44,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:44,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:44,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:44,152 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:44,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:44,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708178577] [2022-07-12 18:38:44,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708178577] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:38:44,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862651263] [2022-07-12 18:38:44,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:44,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:38:44,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:38:44,156 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 18:38:44,184 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 18:38:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:44,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-12 18:38:44,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:38:44,280 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 18:38:44,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:38:44,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18:38:44,371 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:38:44,371 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 18:38:44,419 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:44,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:38:44,665 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 50 treesize of output 46 [2022-07-12 18:38:44,716 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:44,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862651263] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:38:44,717 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:38:44,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2022-07-12 18:38:44,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174364084] [2022-07-12 18:38:44,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:38:44,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 18:38:44,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:44,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 18:38:44,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-07-12 18:38:44,719 INFO L87 Difference]: Start difference. First operand 160 states and 193 transitions. Second operand has 15 states, 14 states have (on average 5.357142857142857) internal successors, (75), 15 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:44,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:44,863 INFO L93 Difference]: Finished difference Result 180 states and 212 transitions. [2022-07-12 18:38:44,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:38:44,863 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 5.357142857142857) internal successors, (75), 15 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-12 18:38:44,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:44,864 INFO L225 Difference]: With dead ends: 180 [2022-07-12 18:38:44,864 INFO L226 Difference]: Without dead ends: 180 [2022-07-12 18:38:44,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2022-07-12 18:38:44,865 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 316 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:44,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 198 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 155 Invalid, 0 Unknown, 62 Unchecked, 0.1s Time] [2022-07-12 18:38:44,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-07-12 18:38:44,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 159. [2022-07-12 18:38:44,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 145 states have (on average 1.3172413793103448) internal successors, (191), 158 states have internal predecessors, (191), 0 states have call successors, (0), 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 18:38:44,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 191 transitions. [2022-07-12 18:38:44,869 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 191 transitions. Word has length 27 [2022-07-12 18:38:44,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:44,869 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 191 transitions. [2022-07-12 18:38:44,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.357142857142857) internal successors, (75), 15 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:44,869 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 191 transitions. [2022-07-12 18:38:44,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 18:38:44,870 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:44,870 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:38:44,895 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 18:38:45,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:38:45,080 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:38:45,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:45,080 INFO L85 PathProgramCache]: Analyzing trace with hash 723701189, now seen corresponding path program 1 times [2022-07-12 18:38:45,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:45,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576464716] [2022-07-12 18:38:45,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:45,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:45,130 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:45,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:45,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576464716] [2022-07-12 18:38:45,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576464716] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:38:45,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720436282] [2022-07-12 18:38:45,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:45,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:38:45,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:38:45,132 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 18:38:45,161 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 18:38:45,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:45,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-12 18:38:45,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:38:45,285 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 13 treesize of output 9 [2022-07-12 18:38:45,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:45,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:38:45,344 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:45,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720436282] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:38:45,345 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:38:45,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 7 [2022-07-12 18:38:45,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082813728] [2022-07-12 18:38:45,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:38:45,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:38:45,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:45,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:38:45,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:38:45,347 INFO L87 Difference]: Start difference. First operand 159 states and 191 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:45,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:45,466 INFO L93 Difference]: Finished difference Result 161 states and 192 transitions. [2022-07-12 18:38:45,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:38:45,467 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-12 18:38:45,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:45,468 INFO L225 Difference]: With dead ends: 161 [2022-07-12 18:38:45,468 INFO L226 Difference]: Without dead ends: 149 [2022-07-12 18:38:45,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:38:45,469 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 19 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:45,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 162 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 45 Unchecked, 0.1s Time] [2022-07-12 18:38:45,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-07-12 18:38:45,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2022-07-12 18:38:45,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 135 states have (on average 1.3333333333333333) internal successors, (180), 148 states have internal predecessors, (180), 0 states have call successors, (0), 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 18:38:45,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 180 transitions. [2022-07-12 18:38:45,472 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 180 transitions. Word has length 28 [2022-07-12 18:38:45,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:45,472 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 180 transitions. [2022-07-12 18:38:45,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:45,473 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 180 transitions. [2022-07-12 18:38:45,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-12 18:38:45,473 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:45,473 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:38:45,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 18:38:45,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:38:45,683 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:38:45,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:45,684 INFO L85 PathProgramCache]: Analyzing trace with hash -28804244, now seen corresponding path program 1 times [2022-07-12 18:38:45,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:45,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921077605] [2022-07-12 18:38:45,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:45,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:45,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:45,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:45,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:45,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921077605] [2022-07-12 18:38:45,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921077605] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:38:45,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083799115] [2022-07-12 18:38:45,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:45,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:38:45,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:38:45,901 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:38:45,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 18:38:46,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:46,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-12 18:38:46,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:38:46,051 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 18:38:46,075 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 18:38:46,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:38:46,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:38:46,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:38:46,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:38:46,122 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:38:46,123 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 18:38:46,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-12 18:38:46,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2022-07-12 18:38:46,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-12 18:38:46,239 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:46,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:38:46,422 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 50 treesize of output 46 [2022-07-12 18:38:46,473 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:46,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083799115] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:38:46,473 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:38:46,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 5] total 17 [2022-07-12 18:38:46,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784489588] [2022-07-12 18:38:46,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:38:46,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-12 18:38:46,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:46,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-12 18:38:46,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-07-12 18:38:46,475 INFO L87 Difference]: Start difference. First operand 149 states and 180 transitions. Second operand has 18 states, 17 states have (on average 4.235294117647059) internal successors, (72), 18 states have internal predecessors, (72), 0 states have call successors, (0), 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 18:38:46,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:46,769 INFO L93 Difference]: Finished difference Result 238 states and 289 transitions. [2022-07-12 18:38:46,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 18:38:46,770 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.235294117647059) internal successors, (72), 18 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-12 18:38:46,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:46,771 INFO L225 Difference]: With dead ends: 238 [2022-07-12 18:38:46,771 INFO L226 Difference]: Without dead ends: 238 [2022-07-12 18:38:46,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=463, Unknown=0, NotChecked=0, Total=600 [2022-07-12 18:38:46,772 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 106 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:46,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 253 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 256 Invalid, 0 Unknown, 46 Unchecked, 0.2s Time] [2022-07-12 18:38:46,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-07-12 18:38:46,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 174. [2022-07-12 18:38:46,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 160 states have (on average 1.3) internal successors, (208), 173 states have internal predecessors, (208), 0 states have call successors, (0), 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 18:38:46,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 208 transitions. [2022-07-12 18:38:46,775 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 208 transitions. Word has length 31 [2022-07-12 18:38:46,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:46,775 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 208 transitions. [2022-07-12 18:38:46,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.235294117647059) internal successors, (72), 18 states have internal predecessors, (72), 0 states have call successors, (0), 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 18:38:46,776 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 208 transitions. [2022-07-12 18:38:46,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-12 18:38:46,776 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:46,776 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:38:46,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 18:38:46,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-12 18:38:46,987 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:38:46,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:46,988 INFO L85 PathProgramCache]: Analyzing trace with hash 36474197, now seen corresponding path program 1 times [2022-07-12 18:38:46,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:46,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657437172] [2022-07-12 18:38:46,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:46,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:47,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:47,059 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:47,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:47,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657437172] [2022-07-12 18:38:47,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657437172] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:38:47,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609854631] [2022-07-12 18:38:47,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:47,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:38:47,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:38:47,061 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:38:47,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 18:38:47,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:47,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-12 18:38:47,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:38:47,207 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 18:38:47,226 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 18:38:47,242 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-12 18:38:47,242 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 21 treesize of output 29 [2022-07-12 18:38:47,279 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 18:38:47,279 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 33 treesize of output 24 [2022-07-12 18:38:47,306 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 18:38:47,307 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 36 treesize of output 16 [2022-07-12 18:38:47,310 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:47,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:38:47,408 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:47,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609854631] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:38:47,408 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:38:47,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-07-12 18:38:47,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410140749] [2022-07-12 18:38:47,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:38:47,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 18:38:47,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:47,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 18:38:47,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-07-12 18:38:47,410 INFO L87 Difference]: Start difference. First operand 174 states and 208 transitions. Second operand has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:47,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:47,555 INFO L93 Difference]: Finished difference Result 192 states and 227 transitions. [2022-07-12 18:38:47,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:38:47,555 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-12 18:38:47,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:47,556 INFO L225 Difference]: With dead ends: 192 [2022-07-12 18:38:47,556 INFO L226 Difference]: Without dead ends: 192 [2022-07-12 18:38:47,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2022-07-12 18:38:47,557 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 65 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:47,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 303 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 208 Invalid, 0 Unknown, 90 Unchecked, 0.1s Time] [2022-07-12 18:38:47,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-07-12 18:38:47,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 173. [2022-07-12 18:38:47,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 160 states have (on average 1.2875) internal successors, (206), 172 states have internal predecessors, (206), 0 states have call successors, (0), 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 18:38:47,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 206 transitions. [2022-07-12 18:38:47,559 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 206 transitions. Word has length 32 [2022-07-12 18:38:47,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:47,560 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 206 transitions. [2022-07-12 18:38:47,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:47,560 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 206 transitions. [2022-07-12 18:38:47,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-12 18:38:47,560 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:47,560 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:38:47,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 18:38:47,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:38:47,771 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:38:47,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:47,772 INFO L85 PathProgramCache]: Analyzing trace with hash 36474198, now seen corresponding path program 1 times [2022-07-12 18:38:47,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:47,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454552197] [2022-07-12 18:38:47,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:47,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:47,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:47,883 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:47,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:47,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454552197] [2022-07-12 18:38:47,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454552197] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:38:47,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149877370] [2022-07-12 18:38:47,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:47,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:38:47,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:38:47,885 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:38:47,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 18:38:48,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:48,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-12 18:38:48,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:38:48,037 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 18:38:48,086 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 18:38:48,090 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 18:38:48,122 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-12 18:38:48,123 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 15 treesize of output 15 [2022-07-12 18:38:48,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 treesize of output 24 [2022-07-12 18:38:48,194 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 18:38:48,195 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 38 treesize of output 29 [2022-07-12 18:38:48,206 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 18:38:48,206 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 39 treesize of output 30 [2022-07-12 18:38:48,258 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 18:38:48,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 22 [2022-07-12 18:38:48,265 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 18:38:48,266 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 37 treesize of output 17 [2022-07-12 18:38:48,284 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:48,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:38:48,497 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 50 treesize of output 46 [2022-07-12 18:38:48,580 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:48,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149877370] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:38:48,581 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:38:48,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-07-12 18:38:48,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629191983] [2022-07-12 18:38:48,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:38:48,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-12 18:38:48,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:48,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-12 18:38:48,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2022-07-12 18:38:48,583 INFO L87 Difference]: Start difference. First operand 173 states and 206 transitions. Second operand has 23 states, 22 states have (on average 3.272727272727273) internal successors, (72), 23 states have internal predecessors, (72), 0 states have call successors, (0), 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 18:38:48,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:48,953 INFO L93 Difference]: Finished difference Result 243 states and 289 transitions. [2022-07-12 18:38:48,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 18:38:48,953 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.272727272727273) internal successors, (72), 23 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-12 18:38:48,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:48,954 INFO L225 Difference]: With dead ends: 243 [2022-07-12 18:38:48,954 INFO L226 Difference]: Without dead ends: 243 [2022-07-12 18:38:48,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=665, Unknown=0, NotChecked=0, Total=812 [2022-07-12 18:38:48,955 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 146 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 144 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:48,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 500 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 314 Invalid, 0 Unknown, 144 Unchecked, 0.2s Time] [2022-07-12 18:38:48,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-07-12 18:38:48,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 164. [2022-07-12 18:38:48,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 152 states have (on average 1.2828947368421053) internal successors, (195), 163 states have internal predecessors, (195), 0 states have call successors, (0), 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 18:38:48,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 195 transitions. [2022-07-12 18:38:48,959 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 195 transitions. Word has length 32 [2022-07-12 18:38:48,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:48,959 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 195 transitions. [2022-07-12 18:38:48,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.272727272727273) internal successors, (72), 23 states have internal predecessors, (72), 0 states have call successors, (0), 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 18:38:48,959 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 195 transitions. [2022-07-12 18:38:48,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-12 18:38:48,959 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:48,959 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:38:48,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 18:38:49,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:38:49,172 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:38:49,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:49,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1911073267, now seen corresponding path program 1 times [2022-07-12 18:38:49,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:49,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484546016] [2022-07-12 18:38:49,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:49,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:49,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:49,305 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:49,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:49,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484546016] [2022-07-12 18:38:49,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484546016] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:38:49,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157287452] [2022-07-12 18:38:49,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:49,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:38:49,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:38:49,307 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:38:49,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 18:38:49,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:49,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 18:38:49,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:38:49,521 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 18:38:49,521 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:38:49,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157287452] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:49,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 18:38:49,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2022-07-12 18:38:49,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536550766] [2022-07-12 18:38:49,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:49,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:38:49,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:49,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:38:49,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-07-12 18:38:49,524 INFO L87 Difference]: Start difference. First operand 164 states and 195 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:49,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:49,646 INFO L93 Difference]: Finished difference Result 178 states and 201 transitions. [2022-07-12 18:38:49,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:38:49,646 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-12 18:38:49,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:49,647 INFO L225 Difference]: With dead ends: 178 [2022-07-12 18:38:49,647 INFO L226 Difference]: Without dead ends: 178 [2022-07-12 18:38:49,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2022-07-12 18:38:49,648 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 116 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:49,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 105 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:38:49,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-12 18:38:49,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 164. [2022-07-12 18:38:49,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 152 states have (on average 1.2763157894736843) internal successors, (194), 163 states have internal predecessors, (194), 0 states have call successors, (0), 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 18:38:49,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 194 transitions. [2022-07-12 18:38:49,651 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 194 transitions. Word has length 33 [2022-07-12 18:38:49,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:49,652 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 194 transitions. [2022-07-12 18:38:49,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:49,652 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 194 transitions. [2022-07-12 18:38:49,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 18:38:49,652 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:49,652 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:38:49,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-12 18:38:49,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-12 18:38:49,863 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:38:49,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:49,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1302827474, now seen corresponding path program 1 times [2022-07-12 18:38:49,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:49,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513632024] [2022-07-12 18:38:49,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:49,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:49,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:49,920 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 18:38:49,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:49,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513632024] [2022-07-12 18:38:49,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513632024] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:49,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:49,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:38:49,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214099254] [2022-07-12 18:38:49,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:49,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:38:49,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:49,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:38:49,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:38:49,923 INFO L87 Difference]: Start difference. First operand 164 states and 194 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:49,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:49,975 INFO L93 Difference]: Finished difference Result 170 states and 192 transitions. [2022-07-12 18:38:49,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:38:49,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-12 18:38:49,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:49,977 INFO L225 Difference]: With dead ends: 170 [2022-07-12 18:38:49,977 INFO L226 Difference]: Without dead ends: 170 [2022-07-12 18:38:49,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:38:49,978 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 104 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:49,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 97 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:38:49,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-07-12 18:38:49,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 135. [2022-07-12 18:38:49,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 123 states have (on average 1.2520325203252032) internal successors, (154), 134 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:49,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 154 transitions. [2022-07-12 18:38:49,981 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 154 transitions. Word has length 36 [2022-07-12 18:38:49,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:49,981 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 154 transitions. [2022-07-12 18:38:49,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:49,982 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 154 transitions. [2022-07-12 18:38:49,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 18:38:49,982 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:49,982 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:38:49,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-12 18:38:49,983 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:38:49,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:49,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1302827524, now seen corresponding path program 1 times [2022-07-12 18:38:49,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:49,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748913575] [2022-07-12 18:38:49,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:49,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:50,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:50,055 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:50,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:50,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748913575] [2022-07-12 18:38:50,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748913575] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:50,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:50,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 18:38:50,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910280608] [2022-07-12 18:38:50,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:50,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:38:50,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:50,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:38:50,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:38:50,058 INFO L87 Difference]: Start difference. First operand 135 states and 154 transitions. Second operand has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 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 18:38:50,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:50,248 INFO L93 Difference]: Finished difference Result 176 states and 197 transitions. [2022-07-12 18:38:50,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 18:38:50,248 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-12 18:38:50,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:50,249 INFO L225 Difference]: With dead ends: 176 [2022-07-12 18:38:50,249 INFO L226 Difference]: Without dead ends: 176 [2022-07-12 18:38:50,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-07-12 18:38:50,250 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 72 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:50,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 167 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:38:50,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-07-12 18:38:50,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 148. [2022-07-12 18:38:50,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 136 states have (on average 1.2647058823529411) internal successors, (172), 147 states have internal predecessors, (172), 0 states have call successors, (0), 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 18:38:50,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 172 transitions. [2022-07-12 18:38:50,253 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 172 transitions. Word has length 36 [2022-07-12 18:38:50,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:50,253 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 172 transitions. [2022-07-12 18:38:50,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 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 18:38:50,253 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 172 transitions. [2022-07-12 18:38:50,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 18:38:50,254 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:50,254 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:38:50,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-12 18:38:50,254 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:38:50,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:50,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1302827525, now seen corresponding path program 1 times [2022-07-12 18:38:50,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:50,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048039739] [2022-07-12 18:38:50,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:50,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:50,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:50,345 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:50,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:50,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048039739] [2022-07-12 18:38:50,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048039739] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:50,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:50,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 18:38:50,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136385496] [2022-07-12 18:38:50,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:50,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:38:50,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:50,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:38:50,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:38:50,348 INFO L87 Difference]: Start difference. First operand 148 states and 172 transitions. Second operand has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 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 18:38:50,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:50,598 INFO L93 Difference]: Finished difference Result 222 states and 250 transitions. [2022-07-12 18:38:50,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 18:38:50,598 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-12 18:38:50,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:50,599 INFO L225 Difference]: With dead ends: 222 [2022-07-12 18:38:50,599 INFO L226 Difference]: Without dead ends: 222 [2022-07-12 18:38:50,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-07-12 18:38:50,600 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 128 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:50,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 249 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:38:50,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-07-12 18:38:50,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 148. [2022-07-12 18:38:50,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 136 states have (on average 1.2573529411764706) internal successors, (171), 147 states have internal predecessors, (171), 0 states have call successors, (0), 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 18:38:50,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 171 transitions. [2022-07-12 18:38:50,603 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 171 transitions. Word has length 36 [2022-07-12 18:38:50,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:50,603 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 171 transitions. [2022-07-12 18:38:50,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 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 18:38:50,603 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 171 transitions. [2022-07-12 18:38:50,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-12 18:38:50,604 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:50,604 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:38:50,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-12 18:38:50,604 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:38:50,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:50,604 INFO L85 PathProgramCache]: Analyzing trace with hash 904979977, now seen corresponding path program 1 times [2022-07-12 18:38:50,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:50,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455362249] [2022-07-12 18:38:50,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:50,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:50,863 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:50,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:50,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455362249] [2022-07-12 18:38:50,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455362249] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:38:50,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553746154] [2022-07-12 18:38:50,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:50,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:38:50,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:38:50,865 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:38:50,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-12 18:38:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:51,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-12 18:38:51,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:38:51,040 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 18:38:51,054 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 18:38:51,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:38:51,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:38:51,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:38:51,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:38:51,143 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:38:51,143 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 18:38:51,180 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 18:38:51,192 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 18:38:51,205 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 18:38:51,216 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 18:38:51,231 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 18:38:51,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:38:51,267 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 18:38:51,288 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 18:38:51,364 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 18:38:51,393 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:51,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:38:51,421 INFO L356 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-07-12 18:38:51,422 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 16 treesize of output 15 [2022-07-12 18:38:51,469 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1787 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1787) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|) |c_ULTIMATE.start_main_~first~0#1.base|)) is different from false [2022-07-12 18:38:51,474 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1787 (Array Int Int)) (v_ArrVal_1786 Int)) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base|) (+ |c_ULTIMATE.start_main_~last~0#1.offset| 12) v_ArrVal_1786)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1787) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|) |c_ULTIMATE.start_main_~first~0#1.base|)) is different from false [2022-07-12 18:38:51,500 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1787 (Array Int Int)) (v_ArrVal_1784 (Array Int Int)) (v_ArrVal_1786 Int)) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1784))) (store .cse0 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~last~0#1.base|) (+ |c_ULTIMATE.start_main_~last~0#1.offset| 12) v_ArrVal_1786))) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1787) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|) |c_ULTIMATE.start_main_~first~0#1.base|)) is different from false [2022-07-12 18:38:51,678 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.base_40| Int) (v_ArrVal_1787 (Array Int Int)) (v_ArrVal_1784 (Array Int Int)) (|v_ULTIMATE.start_main_~last~0#1.offset_15| Int) (v_ArrVal_1786 Int) (v_ArrVal_1778 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_40|) 0)) (= (select (select (store (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_1778)) |v_ULTIMATE.start_main_~x~0#1.base_40| v_ArrVal_1784))) (store .cse0 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |v_ULTIMATE.start_main_~last~0#1.offset_15| 12) v_ArrVal_1786))) |v_ULTIMATE.start_main_~x~0#1.base_40| v_ArrVal_1787) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (<= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~last~0#1.offset_15|)))) is different from false [2022-07-12 18:38:51,693 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.base_40| Int) (v_ArrVal_1787 (Array Int Int)) (v_ArrVal_1784 (Array Int Int)) (|v_ULTIMATE.start_main_~last~0#1.offset_15| Int) (v_ArrVal_1776 Int) (v_ArrVal_1786 Int) (v_ArrVal_1778 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_40|) 0)) (= (select (select (store (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4) v_ArrVal_1776) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_1778)) |v_ULTIMATE.start_main_~x~0#1.base_40| v_ArrVal_1784))) (store .cse0 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |v_ULTIMATE.start_main_~last~0#1.offset_15| 12) v_ArrVal_1786))) |v_ULTIMATE.start_main_~x~0#1.base_40| v_ArrVal_1787) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (<= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~last~0#1.offset_15|)))) is different from false [2022-07-12 18:38:51,702 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:38:51,703 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:38:51,704 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:38:51,708 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:38:51,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 55 [2022-07-12 18:38:51,713 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 70 treesize of output 66 [2022-07-12 18:38:51,716 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:38:51,720 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 22 [2022-07-12 18:38:51,723 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:38:51,725 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 32 treesize of output 28 [2022-07-12 18:38:51,732 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 5 treesize of output 3 [2022-07-12 18:38:51,756 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-07-12 18:38:51,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553746154] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:38:51,757 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:38:51,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 14] total 32 [2022-07-12 18:38:51,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012110206] [2022-07-12 18:38:51,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:38:51,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-12 18:38:51,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:51,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-12 18:38:51,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=623, Unknown=7, NotChecked=270, Total=992 [2022-07-12 18:38:51,759 INFO L87 Difference]: Start difference. First operand 148 states and 171 transitions. Second operand has 32 states, 32 states have (on average 3.25) internal successors, (104), 32 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:52,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:52,672 INFO L93 Difference]: Finished difference Result 234 states and 269 transitions. [2022-07-12 18:38:52,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-12 18:38:52,673 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.25) internal successors, (104), 32 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-12 18:38:52,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:52,674 INFO L225 Difference]: With dead ends: 234 [2022-07-12 18:38:52,674 INFO L226 Difference]: Without dead ends: 234 [2022-07-12 18:38:52,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=287, Invalid=1794, Unknown=9, NotChecked=460, Total=2550 [2022-07-12 18:38:52,675 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 145 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 1298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 717 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:52,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 568 Invalid, 1298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 553 Invalid, 0 Unknown, 717 Unchecked, 0.3s Time] [2022-07-12 18:38:52,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-07-12 18:38:52,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 169. [2022-07-12 18:38:52,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 157 states have (on average 1.2356687898089171) internal successors, (194), 168 states have internal predecessors, (194), 0 states have call successors, (0), 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 18:38:52,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 194 transitions. [2022-07-12 18:38:52,679 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 194 transitions. Word has length 38 [2022-07-12 18:38:52,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:52,679 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 194 transitions. [2022-07-12 18:38:52,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.25) internal successors, (104), 32 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:52,680 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 194 transitions. [2022-07-12 18:38:52,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-12 18:38:52,680 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:52,680 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:38:52,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-12 18:38:52,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:38:52,895 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:38:52,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:52,896 INFO L85 PathProgramCache]: Analyzing trace with hash -2113196924, now seen corresponding path program 1 times [2022-07-12 18:38:52,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:52,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571778706] [2022-07-12 18:38:52,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:52,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:52,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:52,962 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:52,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:52,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571778706] [2022-07-12 18:38:52,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571778706] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:52,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:52,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 18:38:52,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691148438] [2022-07-12 18:38:52,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:52,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 18:38:52,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:52,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 18:38:52,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:38:52,964 INFO L87 Difference]: Start difference. First operand 169 states and 194 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:53,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:53,238 INFO L93 Difference]: Finished difference Result 286 states and 318 transitions. [2022-07-12 18:38:53,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 18:38:53,239 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-12 18:38:53,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:53,240 INFO L225 Difference]: With dead ends: 286 [2022-07-12 18:38:53,240 INFO L226 Difference]: Without dead ends: 286 [2022-07-12 18:38:53,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2022-07-12 18:38:53,241 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 286 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:53,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 417 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:38:53,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-07-12 18:38:53,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 171. [2022-07-12 18:38:53,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 159 states have (on average 1.2327044025157232) internal successors, (196), 170 states have internal predecessors, (196), 0 states have call successors, (0), 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 18:38:53,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 196 transitions. [2022-07-12 18:38:53,245 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 196 transitions. Word has length 38 [2022-07-12 18:38:53,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:53,246 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 196 transitions. [2022-07-12 18:38:53,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:53,246 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 196 transitions. [2022-07-12 18:38:53,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-12 18:38:53,246 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:53,247 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:38:53,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-12 18:38:53,247 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:38:53,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:53,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1084595048, now seen corresponding path program 1 times [2022-07-12 18:38:53,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:53,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189564026] [2022-07-12 18:38:53,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:53,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:53,315 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:53,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:53,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189564026] [2022-07-12 18:38:53,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189564026] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:53,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:53,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 18:38:53,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079322288] [2022-07-12 18:38:53,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:53,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 18:38:53,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:53,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 18:38:53,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:38:53,317 INFO L87 Difference]: Start difference. First operand 171 states and 196 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:53,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:53,612 INFO L93 Difference]: Finished difference Result 283 states and 315 transitions. [2022-07-12 18:38:53,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 18:38:53,613 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-12 18:38:53,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:53,614 INFO L225 Difference]: With dead ends: 283 [2022-07-12 18:38:53,614 INFO L226 Difference]: Without dead ends: 283 [2022-07-12 18:38:53,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-07-12 18:38:53,614 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 192 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:53,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 347 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:38:53,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-07-12 18:38:53,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 172. [2022-07-12 18:38:53,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 160 states have (on average 1.23125) internal successors, (197), 171 states have internal predecessors, (197), 0 states have call successors, (0), 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 18:38:53,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 197 transitions. [2022-07-12 18:38:53,619 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 197 transitions. Word has length 39 [2022-07-12 18:38:53,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:53,619 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 197 transitions. [2022-07-12 18:38:53,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:53,619 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 197 transitions. [2022-07-12 18:38:53,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-12 18:38:53,620 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:53,620 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:38:53,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-12 18:38:53,620 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:38:53,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:53,621 INFO L85 PathProgramCache]: Analyzing trace with hash 693362007, now seen corresponding path program 1 times [2022-07-12 18:38:53,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:53,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805826086] [2022-07-12 18:38:53,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:53,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:53,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:53,686 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:53,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:53,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805826086] [2022-07-12 18:38:53,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805826086] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:38:53,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320091333] [2022-07-12 18:38:53,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:53,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:38:53,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:38:53,692 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:38:53,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-12 18:38:53,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:53,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-12 18:38:53,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:38:53,857 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 18:38:53,906 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:38:53,907 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 18:38:53,952 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:38:53,999 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:38:54,003 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 16 treesize of output 16 [2022-07-12 18:38:54,065 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:54,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:38:54,134 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 11 treesize of output 9 [2022-07-12 18:38:54,136 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 20 treesize of output 18 [2022-07-12 18:38:54,228 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:54,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320091333] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:38:54,229 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:38:54,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 20 [2022-07-12 18:38:54,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943649767] [2022-07-12 18:38:54,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:38:54,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-12 18:38:54,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:54,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-12 18:38:54,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2022-07-12 18:38:54,230 INFO L87 Difference]: Start difference. First operand 172 states and 197 transitions. Second operand has 20 states, 20 states have (on average 4.3) internal successors, (86), 20 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:54,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:54,794 INFO L93 Difference]: Finished difference Result 260 states and 288 transitions. [2022-07-12 18:38:54,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 18:38:54,795 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.3) internal successors, (86), 20 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-07-12 18:38:54,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:54,796 INFO L225 Difference]: With dead ends: 260 [2022-07-12 18:38:54,796 INFO L226 Difference]: Without dead ends: 260 [2022-07-12 18:38:54,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=817, Unknown=0, NotChecked=0, Total=992 [2022-07-12 18:38:54,796 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 307 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:54,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 575 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 698 Invalid, 0 Unknown, 35 Unchecked, 0.3s Time] [2022-07-12 18:38:54,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-07-12 18:38:54,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 172. [2022-07-12 18:38:54,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 160 states have (on average 1.225) internal successors, (196), 171 states have internal predecessors, (196), 0 states have call successors, (0), 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 18:38:54,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 196 transitions. [2022-07-12 18:38:54,800 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 196 transitions. Word has length 40 [2022-07-12 18:38:54,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:54,800 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 196 transitions. [2022-07-12 18:38:54,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.3) internal successors, (86), 20 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:54,800 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 196 transitions. [2022-07-12 18:38:54,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-12 18:38:54,801 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:54,801 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:38:54,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-12 18:38:55,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-07-12 18:38:55,002 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:38:55,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:55,002 INFO L85 PathProgramCache]: Analyzing trace with hash 737292038, now seen corresponding path program 1 times [2022-07-12 18:38:55,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:55,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203944601] [2022-07-12 18:38:55,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:55,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:55,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:55,042 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 18:38:55,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:55,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203944601] [2022-07-12 18:38:55,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203944601] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:55,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:55,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:38:55,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564043772] [2022-07-12 18:38:55,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:55,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:38:55,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:55,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:38:55,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:38:55,045 INFO L87 Difference]: Start difference. First operand 172 states and 196 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:55,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:55,098 INFO L93 Difference]: Finished difference Result 171 states and 194 transitions. [2022-07-12 18:38:55,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:38:55,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-07-12 18:38:55,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:55,099 INFO L225 Difference]: With dead ends: 171 [2022-07-12 18:38:55,099 INFO L226 Difference]: Without dead ends: 171 [2022-07-12 18:38:55,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:38:55,101 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 5 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:55,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 103 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:38:55,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-12 18:38:55,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2022-07-12 18:38:55,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 160 states have (on average 1.2125) internal successors, (194), 170 states have internal predecessors, (194), 0 states have call successors, (0), 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 18:38:55,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 194 transitions. [2022-07-12 18:38:55,104 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 194 transitions. Word has length 40 [2022-07-12 18:38:55,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:55,104 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 194 transitions. [2022-07-12 18:38:55,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:55,104 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 194 transitions. [2022-07-12 18:38:55,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-12 18:38:55,105 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:55,105 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:38:55,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-12 18:38:55,105 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:38:55,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:55,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1696179932, now seen corresponding path program 1 times [2022-07-12 18:38:55,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:55,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986216181] [2022-07-12 18:38:55,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:55,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:55,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:55,308 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:55,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:55,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986216181] [2022-07-12 18:38:55,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986216181] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:38:55,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710970203] [2022-07-12 18:38:55,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:55,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:38:55,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:38:55,310 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:38:55,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-12 18:38:55,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:55,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-12 18:38:55,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:38:55,484 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 18:38:55,548 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 18:38:55,548 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 18:38:55,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:38:55,683 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:38:55,684 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 28 treesize of output 29 [2022-07-12 18:38:55,740 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 25 treesize of output 13 [2022-07-12 18:38:55,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-07-12 18:38:55,804 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:55,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:38:55,888 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2271 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2271) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)) |c_ULTIMATE.start_main_~first~0#1.base|))) (forall ((v_ArrVal_2271 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2271) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12))) 1))) is different from false [2022-07-12 18:38:55,894 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:38:55,895 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 23 treesize of output 24 [2022-07-12 18:38:55,901 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:38:55,902 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 39 treesize of output 42 [2022-07-12 18:38:55,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2022-07-12 18:38:55,921 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:38:55,921 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 24 treesize of output 25 [2022-07-12 18:38:55,923 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:38:55,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:38:55,925 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-07-12 18:38:56,089 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:56,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710970203] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:38:56,090 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:38:56,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 24 [2022-07-12 18:38:56,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132626142] [2022-07-12 18:38:56,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:38:56,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-12 18:38:56,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:56,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-12 18:38:56,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=465, Unknown=1, NotChecked=44, Total=600 [2022-07-12 18:38:56,092 INFO L87 Difference]: Start difference. First operand 171 states and 194 transitions. Second operand has 25 states, 24 states have (on average 4.166666666666667) internal successors, (100), 25 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:56,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:56,664 INFO L93 Difference]: Finished difference Result 255 states and 281 transitions. [2022-07-12 18:38:56,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 18:38:56,665 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.166666666666667) internal successors, (100), 25 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-12 18:38:56,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:56,666 INFO L225 Difference]: With dead ends: 255 [2022-07-12 18:38:56,666 INFO L226 Difference]: Without dead ends: 255 [2022-07-12 18:38:56,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=229, Invalid=964, Unknown=1, NotChecked=66, Total=1260 [2022-07-12 18:38:56,667 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 243 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 141 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:56,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 475 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 700 Invalid, 0 Unknown, 141 Unchecked, 0.4s Time] [2022-07-12 18:38:56,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-07-12 18:38:56,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 225. [2022-07-12 18:38:56,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 214 states have (on average 1.1962616822429906) internal successors, (256), 224 states have internal predecessors, (256), 0 states have call successors, (0), 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 18:38:56,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 256 transitions. [2022-07-12 18:38:56,671 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 256 transitions. Word has length 42 [2022-07-12 18:38:56,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:56,671 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 256 transitions. [2022-07-12 18:38:56,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.166666666666667) internal successors, (100), 25 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:56,672 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 256 transitions. [2022-07-12 18:38:56,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-12 18:38:56,672 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:56,672 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:38:56,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-12 18:38:56,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-07-12 18:38:56,873 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:38:56,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:56,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1696179933, now seen corresponding path program 1 times [2022-07-12 18:38:56,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:56,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467491307] [2022-07-12 18:38:56,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:56,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:56,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:57,161 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:57,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:57,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467491307] [2022-07-12 18:38:57,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467491307] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:38:57,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348718024] [2022-07-12 18:38:57,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:57,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:38:57,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:38:57,164 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:38:57,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-12 18:38:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:57,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-12 18:38:57,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:38:57,365 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 18:38:57,431 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:38:57,431 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 18:38:57,567 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 18:38:57,573 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 18:38:57,608 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:38:57,608 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 46 treesize of output 45 [2022-07-12 18:38:57,612 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 22 treesize of output 24 [2022-07-12 18:38:57,661 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 25 treesize of output 13 [2022-07-12 18:38:57,664 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 15 treesize of output 7 [2022-07-12 18:38:57,710 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:57,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:38:57,810 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2432 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2432) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)) 12))) (forall ((v_ArrVal_2433 (Array Int Int)) (v_ArrVal_2432 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2432) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0) 16) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2433) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0)))))) is different from false [2022-07-12 18:38:57,817 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:38:57,817 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 24 treesize of output 25 [2022-07-12 18:38:57,824 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:38:57,824 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 40 treesize of output 43 [2022-07-12 18:38:57,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 18:38:57,840 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:38:57,840 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 45 treesize of output 46 [2022-07-12 18:38:57,845 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:38:57,845 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 35 treesize of output 36 [2022-07-12 18:38:57,847 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:38:57,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:38:57,849 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2022-07-12 18:38:57,851 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:38:57,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:38:57,853 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-07-12 18:38:57,928 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 6 [2022-07-12 18:38:58,029 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:58,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348718024] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:38:58,029 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:38:58,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25 [2022-07-12 18:38:58,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319172739] [2022-07-12 18:38:58,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:38:58,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-12 18:38:58,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:58,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-12 18:38:58,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=519, Unknown=1, NotChecked=46, Total=650 [2022-07-12 18:38:58,031 INFO L87 Difference]: Start difference. First operand 225 states and 256 transitions. Second operand has 26 states, 25 states have (on average 4.76) internal successors, (119), 26 states have internal predecessors, (119), 0 states have call successors, (0), 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 18:38:58,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:58,665 INFO L93 Difference]: Finished difference Result 308 states and 348 transitions. [2022-07-12 18:38:58,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 18:38:58,666 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 4.76) internal successors, (119), 26 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-12 18:38:58,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:58,667 INFO L225 Difference]: With dead ends: 308 [2022-07-12 18:38:58,668 INFO L226 Difference]: Without dead ends: 308 [2022-07-12 18:38:58,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=208, Invalid=1054, Unknown=2, NotChecked=68, Total=1332 [2022-07-12 18:38:58,669 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 184 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 184 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:58,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 629 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 596 Invalid, 0 Unknown, 184 Unchecked, 0.3s Time] [2022-07-12 18:38:58,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-07-12 18:38:58,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 236. [2022-07-12 18:38:58,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 225 states have (on average 1.2177777777777778) internal successors, (274), 235 states have internal predecessors, (274), 0 states have call successors, (0), 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 18:38:58,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 274 transitions. [2022-07-12 18:38:58,673 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 274 transitions. Word has length 42 [2022-07-12 18:38:58,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:58,673 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 274 transitions. [2022-07-12 18:38:58,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 4.76) internal successors, (119), 26 states have internal predecessors, (119), 0 states have call successors, (0), 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 18:38:58,674 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 274 transitions. [2022-07-12 18:38:58,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-12 18:38:58,674 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:58,674 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:38:58,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-12 18:38:58,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-07-12 18:38:58,887 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:38:58,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:58,888 INFO L85 PathProgramCache]: Analyzing trace with hash -131950583, now seen corresponding path program 1 times [2022-07-12 18:38:58,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:58,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536470266] [2022-07-12 18:38:58,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:58,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:58,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:59,241 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:59,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:59,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536470266] [2022-07-12 18:38:59,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536470266] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:38:59,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677919945] [2022-07-12 18:38:59,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:59,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:38:59,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:38:59,248 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:38:59,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-12 18:38:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:59,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 79 conjunts are in the unsatisfiable core [2022-07-12 18:38:59,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:38:59,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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 18:38:59,473 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 18:38:59,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:38:59,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:38:59,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:38:59,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:38:59,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:38:59,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:38:59,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:38:59,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:38:59,598 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-12 18:38:59,599 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 23 treesize of output 18 [2022-07-12 18:38:59,610 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-12 18:38:59,611 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 23 treesize of output 18 [2022-07-12 18:38:59,706 INFO L356 Elim1Store]: treesize reduction 29, result has 38.3 percent of original size [2022-07-12 18:38:59,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 48 [2022-07-12 18:38:59,729 INFO L356 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2022-07-12 18:38:59,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 41 [2022-07-12 18:38:59,738 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 5 [2022-07-12 18:38:59,749 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 5 treesize of output 3 [2022-07-12 18:38:59,754 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 5 [2022-07-12 18:38:59,776 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 18:38:59,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:38:59,829 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 33 treesize of output 32 [2022-07-12 18:38:59,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:38:59,831 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 33 treesize of output 32 [2022-07-12 18:38:59,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2022-07-12 18:38:59,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2022-07-12 18:38:59,890 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-12 18:38:59,891 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 31 treesize of output 34 [2022-07-12 18:38:59,906 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-07-12 18:38:59,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 40 [2022-07-12 18:39:00,196 INFO L356 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2022-07-12 18:39:00,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 67 treesize of output 57 [2022-07-12 18:39:00,217 INFO L356 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2022-07-12 18:39:00,217 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 30 treesize of output 34 [2022-07-12 18:39:00,345 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:39:00,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:39:00,671 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 18:39:00,674 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2590 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2590) |c_ULTIMATE.start_main_~y~0#1.base|) 0)) (not (= (select v_ArrVal_2590 |c_ULTIMATE.start_main_~x~0#1.offset|) 0)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~y~0#1.base|)) |c_ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|)) is different from false [2022-07-12 18:39:00,688 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2587 Int)) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_2587)))) (store .cse0 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~y~0#1.base|))) |c_ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|)) (forall ((v_ArrVal_2589 Int) (v_ArrVal_2590 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_2589)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2590) |c_ULTIMATE.start_main_~y~0#1.base|) 0)) (not (= (select v_ArrVal_2590 |c_ULTIMATE.start_main_~x~0#1.offset|) 0))))) is different from false [2022-07-12 18:39:00,700 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2583 Int) (v_ArrVal_2589 Int) (v_ArrVal_2590 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~y~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 4) v_ArrVal_2583) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_2589)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2590) |c_ULTIMATE.start_main_~y~0#1.base|) 0)) (not (= (select v_ArrVal_2590 |c_ULTIMATE.start_main_~x~0#1.offset|) 0)))) (forall ((v_ArrVal_2585 Int) (v_ArrVal_2587 Int)) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 4) v_ArrVal_2585) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_2587)))) (store .cse0 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~y~0#1.base|))) |c_ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|))) is different from false [2022-07-12 18:39:00,724 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2585 Int) (v_ArrVal_2587 Int) (v_ArrVal_2581 (Array Int Int))) (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2581))) (store .cse1 |c_ULTIMATE.start_main_~y~0#1.base| (store (store (select .cse1 |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 4) v_ArrVal_2585) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_2587))))) (store .cse0 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~y~0#1.base|))) |c_ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|)) (forall ((v_ArrVal_2583 Int) (v_ArrVal_2589 Int) (v_ArrVal_2580 (Array Int Int)) (v_ArrVal_2590 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2580))) (store .cse2 |c_ULTIMATE.start_main_~y~0#1.base| (store (store (select .cse2 |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 4) v_ArrVal_2583) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_2589))) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2590) |c_ULTIMATE.start_main_~y~0#1.base|) 0)) (not (= (select v_ArrVal_2590 |c_ULTIMATE.start_main_~x~0#1.offset|) 0))))) is different from false [2022-07-12 18:39:00,738 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2585 Int) (v_ArrVal_2587 Int) (v_ArrVal_2581 (Array Int Int))) (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|) v_ArrVal_2581))) (store .cse1 |c_ULTIMATE.start_main_~y~0#1.base| (store (store (select .cse1 |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 4) v_ArrVal_2585) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_2587))))) (store .cse0 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~y~0#1.base|))) |c_ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|)) (forall ((v_ArrVal_2583 Int) (v_ArrVal_2589 Int) (v_ArrVal_2580 (Array Int Int)) (v_ArrVal_2590 (Array Int Int))) (or (not (= (select v_ArrVal_2590 |c_ULTIMATE.start_main_~x~0#1.offset|) 0)) (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|) v_ArrVal_2580))) (store .cse2 |c_ULTIMATE.start_main_~y~0#1.base| (store (store (select .cse2 |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 4) v_ArrVal_2583) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_2589))) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2590) |c_ULTIMATE.start_main_~y~0#1.base|) 0))))) is different from false [2022-07-12 18:39:01,293 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2573 Int) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_2585 Int) (v_ArrVal_2587 Int) (v_ArrVal_2581 (Array Int Int))) (= (select (select (let ((.cse0 (let ((.cse1 (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_2573)))) (store .cse2 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse2 |ULTIMATE.start_main_~y~0#1.base|) 0 .cse3))) .cse3 v_ArrVal_2581))))) (store .cse1 |ULTIMATE.start_main_~y~0#1.base| (store (store (select .cse1 |ULTIMATE.start_main_~y~0#1.base|) 4 v_ArrVal_2585) 8 v_ArrVal_2587))))) (store .cse0 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|))) |ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|)) (forall ((v_ArrVal_2583 Int) (v_ArrVal_2575 Int) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_2589 Int) (v_ArrVal_2580 (Array Int Int)) (v_ArrVal_2590 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (store (let ((.cse5 (store (let ((.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse7 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_2575)))) (store .cse6 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse6 |ULTIMATE.start_main_~y~0#1.base|) 0 (select .cse7 |c_ULTIMATE.start_main_~x~0#1.offset|))))) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2580))) (store .cse5 |ULTIMATE.start_main_~y~0#1.base| (store (store (select .cse5 |ULTIMATE.start_main_~y~0#1.base|) 4 v_ArrVal_2583) 8 v_ArrVal_2589))) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2590) |ULTIMATE.start_main_~y~0#1.base|) 0)) (not (= (select v_ArrVal_2590 |c_ULTIMATE.start_main_~x~0#1.offset|) 0))))) is different from false [2022-07-12 18:39:01,310 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2571 Int) (v_ArrVal_2583 Int) (v_ArrVal_2575 Int) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_2589 Int) (v_ArrVal_2580 (Array Int Int)) (v_ArrVal_2590 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (store (let ((.cse0 (store (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse2 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4) v_ArrVal_2571) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_2575)))) (store .cse1 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse1 |ULTIMATE.start_main_~y~0#1.base|) 0 (select .cse2 |c_ULTIMATE.start_main_~x~0#1.offset|))))) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2580))) (store .cse0 |ULTIMATE.start_main_~y~0#1.base| (store (store (select .cse0 |ULTIMATE.start_main_~y~0#1.base|) 4 v_ArrVal_2583) 8 v_ArrVal_2589))) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2590) |ULTIMATE.start_main_~y~0#1.base|) 0)) (not (= (select v_ArrVal_2590 |c_ULTIMATE.start_main_~x~0#1.offset|) 0)))) (forall ((v_ArrVal_2570 Int) (v_ArrVal_2573 Int) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_2585 Int) (v_ArrVal_2587 Int) (v_ArrVal_2581 (Array Int Int))) (= (select (select (let ((.cse3 (let ((.cse4 (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse7 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4) v_ArrVal_2570) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_2573)))) (store .cse5 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse5 |ULTIMATE.start_main_~y~0#1.base|) 0 .cse6))) .cse6 v_ArrVal_2581))))) (store .cse4 |ULTIMATE.start_main_~y~0#1.base| (store (store (select .cse4 |ULTIMATE.start_main_~y~0#1.base|) 4 v_ArrVal_2585) 8 v_ArrVal_2587))))) (store .cse3 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|))) |ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|))) is different from false [2022-07-12 18:39:01,390 INFO L356 Elim1Store]: treesize reduction 174, result has 22.7 percent of original size [2022-07-12 18:39:01,390 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 4 case distinctions, treesize of input 225 treesize of output 100 [2022-07-12 18:39:01,409 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:39:01,409 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 262 treesize of output 210 [2022-07-12 18:39:01,416 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 16 treesize of output 14 [2022-07-12 18:39:01,419 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:01,419 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:01,420 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:01,428 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:39:01,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 47 [2022-07-12 18:39:01,457 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:01,458 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:01,458 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:01,463 INFO L356 Elim1Store]: treesize reduction 53, result has 1.9 percent of original size [2022-07-12 18:39:01,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 115 treesize of output 1 [2022-07-12 18:39:01,468 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:39:01,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677919945] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:39:01,468 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:39:01,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 22] total 54 [2022-07-12 18:39:01,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741230156] [2022-07-12 18:39:01,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:39:01,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-07-12 18:39:01,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:39:01,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-07-12 18:39:01,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1857, Unknown=139, NotChecked=672, Total=2862 [2022-07-12 18:39:01,473 INFO L87 Difference]: Start difference. First operand 236 states and 274 transitions. Second operand has 54 states, 54 states have (on average 2.0555555555555554) internal successors, (111), 54 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:39:04,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:39:04,836 INFO L93 Difference]: Finished difference Result 501 states and 597 transitions. [2022-07-12 18:39:04,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-07-12 18:39:04,836 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.0555555555555554) internal successors, (111), 54 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-12 18:39:04,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:39:04,838 INFO L225 Difference]: With dead ends: 501 [2022-07-12 18:39:04,838 INFO L226 Difference]: Without dead ends: 501 [2022-07-12 18:39:04,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 94 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1816 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=842, Invalid=6753, Unknown=265, NotChecked=1260, Total=9120 [2022-07-12 18:39:04,841 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 425 mSDsluCounter, 1136 mSDsCounter, 0 mSdLazyCounter, 1493 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 2769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 1493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1143 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 18:39:04,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 1189 Invalid, 2769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 1493 Invalid, 0 Unknown, 1143 Unchecked, 0.7s Time] [2022-07-12 18:39:04,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2022-07-12 18:39:04,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 246. [2022-07-12 18:39:04,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 235 states have (on average 1.2085106382978723) internal successors, (284), 245 states have internal predecessors, (284), 0 states have call successors, (0), 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 18:39:04,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 284 transitions. [2022-07-12 18:39:04,847 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 284 transitions. Word has length 42 [2022-07-12 18:39:04,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:39:04,848 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 284 transitions. [2022-07-12 18:39:04,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 2.0555555555555554) internal successors, (111), 54 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:39:04,848 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 284 transitions. [2022-07-12 18:39:04,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-12 18:39:04,848 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:39:04,849 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:39:04,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-12 18:39:05,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-07-12 18:39:05,049 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:39:05,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:39:05,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1041969739, now seen corresponding path program 1 times [2022-07-12 18:39:05,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:39:05,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934199713] [2022-07-12 18:39:05,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:39:05,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:39:05,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:39:05,193 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:39:05,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:39:05,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934199713] [2022-07-12 18:39:05,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934199713] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:39:05,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230536513] [2022-07-12 18:39:05,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:39:05,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:39:05,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:39:05,195 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:39:05,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-12 18:39:05,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:39:05,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-12 18:39:05,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:39:05,417 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 18:39:05,455 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:39:05,456 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 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 18:39:05,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 18:39:05,550 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:39:05,550 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 27 treesize of output 28 [2022-07-12 18:39:05,599 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 24 treesize of output 12 [2022-07-12 18:39:05,609 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:39:05,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:39:05,640 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2750 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2750) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)) 0))) is different from false [2022-07-12 18:39:05,645 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:39:05,645 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 23 treesize of output 24 [2022-07-12 18:39:05,652 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:39:05,652 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 39 treesize of output 42 [2022-07-12 18:39:05,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2022-07-12 18:39:05,843 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:39:05,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230536513] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:39:05,843 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:39:05,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 17 [2022-07-12 18:39:05,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935677533] [2022-07-12 18:39:05,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:39:05,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-12 18:39:05,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:39:05,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-12 18:39:05,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=200, Unknown=1, NotChecked=28, Total=272 [2022-07-12 18:39:05,845 INFO L87 Difference]: Start difference. First operand 246 states and 284 transitions. Second operand has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:39:06,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:39:06,174 INFO L93 Difference]: Finished difference Result 301 states and 338 transitions. [2022-07-12 18:39:06,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 18:39:06,175 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-07-12 18:39:06,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:39:06,176 INFO L225 Difference]: With dead ends: 301 [2022-07-12 18:39:06,176 INFO L226 Difference]: Without dead ends: 301 [2022-07-12 18:39:06,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=441, Unknown=1, NotChecked=44, Total=600 [2022-07-12 18:39:06,176 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 166 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 140 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:39:06,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 641 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 405 Invalid, 0 Unknown, 140 Unchecked, 0.2s Time] [2022-07-12 18:39:06,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-07-12 18:39:06,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 246. [2022-07-12 18:39:06,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 235 states have (on average 1.2) internal successors, (282), 245 states have internal predecessors, (282), 0 states have call successors, (0), 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 18:39:06,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 282 transitions. [2022-07-12 18:39:06,180 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 282 transitions. Word has length 43 [2022-07-12 18:39:06,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:39:06,181 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 282 transitions. [2022-07-12 18:39:06,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:39:06,181 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 282 transitions. [2022-07-12 18:39:06,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 18:39:06,181 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:39:06,181 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:39:06,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-12 18:39:06,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:39:06,395 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:39:06,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:39:06,396 INFO L85 PathProgramCache]: Analyzing trace with hash -2058655426, now seen corresponding path program 1 times [2022-07-12 18:39:06,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:39:06,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374663555] [2022-07-12 18:39:06,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:39:06,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:39:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:39:06,563 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:39:06,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:39:06,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374663555] [2022-07-12 18:39:06,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374663555] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:39:06,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655318078] [2022-07-12 18:39:06,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:39:06,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:39:06,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:39:06,564 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:39:06,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-12 18:39:06,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:39:06,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-12 18:39:06,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:39:06,752 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 18:39:06,758 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 18:39:06,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:39:06,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 18:39:06,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:39:06,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:39:06,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:39:06,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 18:39:06,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:39:06,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 18:39:06,864 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:39:06,865 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 18:39:06,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 18:39:06,913 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 18:39:06,927 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 18:39:06,934 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 18:39:06,948 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 18:39:07,017 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-12 18:39:07,017 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 21 treesize of output 20 [2022-07-12 18:39:07,052 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 18:39:07,079 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 7 treesize of output 3 [2022-07-12 18:39:07,081 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 18:39:07,123 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:39:07,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:39:07,147 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:39:07,148 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 18:39:07,225 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2923 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2923) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)))) is different from false [2022-07-12 18:39:07,230 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2923 (Array Int Int)) (|ULTIMATE.start_main_~last~0#1.offset| Int)) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |c_ULTIMATE.start_main_~x~0#1.offset|)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2923) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)))) is different from false [2022-07-12 18:39:07,244 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2923 (Array Int Int)) (v_ArrVal_2920 (Array Int Int)) (|ULTIMATE.start_main_~last~0#1.offset| Int)) (<= 0 (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2920))) (store .cse0 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |c_ULTIMATE.start_main_~x~0#1.offset|))) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2923) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)))) is different from false [2022-07-12 18:39:07,565 INFO L356 Elim1Store]: treesize reduction 320, result has 13.3 percent of original size [2022-07-12 18:39:07,565 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 5 case distinctions, treesize of input 84 treesize of output 77 [2022-07-12 18:39:07,569 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 80 treesize of output 76 [2022-07-12 18:39:07,574 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 55 treesize of output 47 [2022-07-12 18:39:07,577 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 18:39:07,604 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-07-12 18:39:07,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655318078] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:39:07,604 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:39:07,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 16] total 32 [2022-07-12 18:39:07,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300352344] [2022-07-12 18:39:07,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:39:07,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-12 18:39:07,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:39:07,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-12 18:39:07,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=729, Unknown=36, NotChecked=174, Total=1056 [2022-07-12 18:39:07,606 INFO L87 Difference]: Start difference. First operand 246 states and 282 transitions. Second operand has 33 states, 32 states have (on average 3.5625) internal successors, (114), 33 states have internal predecessors, (114), 0 states have call successors, (0), 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 18:39:14,082 WARN L233 SmtUtils]: Spent 6.33s on a formula simplification. DAG size of input: 41 DAG size of output: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 18:39:22,680 WARN L233 SmtUtils]: Spent 8.58s on a formula simplification. DAG size of input: 41 DAG size of output: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 18:39:23,031 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|) 1) (= (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12) 12) (not (= |c_ULTIMATE.start_main_~last~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (= (+ |c_ULTIMATE.start_main_~last~0#1.offset| 12) 12) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0) (= |c_ULTIMATE.start_main_~last~0#1.base| |c_ULTIMATE.start_main_~first~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~last~0#1.base|) 12) 0) (forall ((v_ArrVal_2923 (Array Int Int)) (|ULTIMATE.start_main_~last~0#1.offset| Int)) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |c_ULTIMATE.start_main_~x~0#1.offset|)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2923) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)))) (= |c_ULTIMATE.start_main_~first~0#1.offset| 0)) is different from false [2022-07-12 18:39:23,365 WARN L833 $PredicateComparison]: unable to prove that (and (= (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12) 12) (not (= |c_ULTIMATE.start_main_~last~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (= (+ |c_ULTIMATE.start_main_~last~0#1.offset| 12) 12) (= |c_ULTIMATE.start_main_~last~0#1.base| |c_ULTIMATE.start_main_~first~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~last~0#1.base|) 12) 0) (forall ((v_ArrVal_2923 (Array Int Int)) (|ULTIMATE.start_main_~last~0#1.offset| Int)) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |c_ULTIMATE.start_main_~x~0#1.offset|)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2923) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)))) (= |c_ULTIMATE.start_main_~first~0#1.offset| 0)) is different from false [2022-07-12 18:39:24,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:39:24,289 INFO L93 Difference]: Finished difference Result 484 states and 542 transitions. [2022-07-12 18:39:24,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-07-12 18:39:24,289 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.5625) internal successors, (114), 33 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-07-12 18:39:24,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:39:24,290 INFO L225 Difference]: With dead ends: 484 [2022-07-12 18:39:24,290 INFO L226 Difference]: Without dead ends: 484 [2022-07-12 18:39:24,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 83 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 1032 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=637, Invalid=3501, Unknown=42, NotChecked=650, Total=4830 [2022-07-12 18:39:24,292 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 620 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 2471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1249 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 18:39:24,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 817 Invalid, 2471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1105 Invalid, 0 Unknown, 1249 Unchecked, 0.5s Time] [2022-07-12 18:39:24,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2022-07-12 18:39:24,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 299. [2022-07-12 18:39:24,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 288 states have (on average 1.2222222222222223) internal successors, (352), 298 states have internal predecessors, (352), 0 states have call successors, (0), 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 18:39:24,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 352 transitions. [2022-07-12 18:39:24,298 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 352 transitions. Word has length 44 [2022-07-12 18:39:24,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:39:24,298 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 352 transitions. [2022-07-12 18:39:24,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.5625) internal successors, (114), 33 states have internal predecessors, (114), 0 states have call successors, (0), 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 18:39:24,298 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 352 transitions. [2022-07-12 18:39:24,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 18:39:24,299 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:39:24,299 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:39:24,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-12 18:39:24,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-07-12 18:39:24,515 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:39:24,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:39:24,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1393098207, now seen corresponding path program 2 times [2022-07-12 18:39:24,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:39:24,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453799909] [2022-07-12 18:39:24,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:39:24,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:39:24,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:39:24,714 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:39:24,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:39:24,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453799909] [2022-07-12 18:39:24,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453799909] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:39:24,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012009165] [2022-07-12 18:39:24,715 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:39:24,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:39:24,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:39:24,716 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:39:24,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-12 18:39:24,917 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 18:39:24,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:39:24,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-12 18:39:24,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:39:24,925 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 18:39:24,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:39:24,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18:39:24,976 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:39:24,976 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 18:39:25,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:39:25,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18:39:25,044 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:39:25,045 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 18:39:25,115 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 18:39:25,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:39:25,300 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:39:25,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 37 treesize of output 55 [2022-07-12 18:39:25,417 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 50 treesize of output 46 [2022-07-12 18:39:25,446 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 18:39:25,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012009165] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:39:25,446 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:39:25,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 19 [2022-07-12 18:39:25,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315201059] [2022-07-12 18:39:25,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:39:25,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-12 18:39:25,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:39:25,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-12 18:39:25,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2022-07-12 18:39:25,448 INFO L87 Difference]: Start difference. First operand 299 states and 352 transitions. Second operand has 20 states, 19 states have (on average 6.315789473684211) internal successors, (120), 20 states have internal predecessors, (120), 0 states have call successors, (0), 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 18:39:25,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:39:25,745 INFO L93 Difference]: Finished difference Result 474 states and 567 transitions. [2022-07-12 18:39:25,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 18:39:25,746 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 6.315789473684211) internal successors, (120), 20 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-07-12 18:39:25,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:39:25,747 INFO L225 Difference]: With dead ends: 474 [2022-07-12 18:39:25,747 INFO L226 Difference]: Without dead ends: 474 [2022-07-12 18:39:25,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=266, Invalid=604, Unknown=0, NotChecked=0, Total=870 [2022-07-12 18:39:25,747 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 467 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:39:25,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 315 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 348 Invalid, 0 Unknown, 33 Unchecked, 0.2s Time] [2022-07-12 18:39:25,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-07-12 18:39:25,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 292. [2022-07-12 18:39:25,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 281 states have (on average 1.2241992882562278) internal successors, (344), 291 states have internal predecessors, (344), 0 states have call successors, (0), 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 18:39:25,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 344 transitions. [2022-07-12 18:39:25,752 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 344 transitions. Word has length 44 [2022-07-12 18:39:25,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:39:25,753 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 344 transitions. [2022-07-12 18:39:25,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 6.315789473684211) internal successors, (120), 20 states have internal predecessors, (120), 0 states have call successors, (0), 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 18:39:25,753 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 344 transitions. [2022-07-12 18:39:25,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 18:39:25,753 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:39:25,754 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:39:25,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-07-12 18:39:25,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-07-12 18:39:25,977 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:39:25,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:39:25,978 INFO L85 PathProgramCache]: Analyzing trace with hash 489910956, now seen corresponding path program 1 times [2022-07-12 18:39:25,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:39:25,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979543611] [2022-07-12 18:39:25,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:39:25,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:39:26,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:39:26,071 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:39:26,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:39:26,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979543611] [2022-07-12 18:39:26,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979543611] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:39:26,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2220379] [2022-07-12 18:39:26,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:39:26,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:39:26,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:39:26,074 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:39:26,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-12 18:39:26,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:39:26,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 18:39:26,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:39:26,445 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 18:39:26,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:39:26,476 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:39:26,476 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 22 treesize of output 26 [2022-07-12 18:39:26,626 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 18:39:26,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2220379] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:39:26,626 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:39:26,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 10 [2022-07-12 18:39:26,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117441787] [2022-07-12 18:39:26,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:39:26,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 18:39:26,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:39:26,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 18:39:26,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-07-12 18:39:26,628 INFO L87 Difference]: Start difference. First operand 292 states and 344 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:39:26,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:39:26,773 INFO L93 Difference]: Finished difference Result 310 states and 362 transitions. [2022-07-12 18:39:26,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:39:26,773 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-07-12 18:39:26,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:39:26,774 INFO L225 Difference]: With dead ends: 310 [2022-07-12 18:39:26,774 INFO L226 Difference]: Without dead ends: 310 [2022-07-12 18:39:26,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-07-12 18:39:26,775 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 121 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:39:26,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 214 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:39:26,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-07-12 18:39:26,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 282. [2022-07-12 18:39:26,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 271 states have (on average 1.2177121771217712) internal successors, (330), 281 states have internal predecessors, (330), 0 states have call successors, (0), 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 18:39:26,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 330 transitions. [2022-07-12 18:39:26,779 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 330 transitions. Word has length 46 [2022-07-12 18:39:26,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:39:26,780 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 330 transitions. [2022-07-12 18:39:26,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:39:26,780 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 330 transitions. [2022-07-12 18:39:26,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 18:39:26,780 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:39:26,781 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:39:26,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-12 18:39:26,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:39:26,999 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:39:27,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:39:27,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1931630812, now seen corresponding path program 1 times [2022-07-12 18:39:27,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:39:27,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078633498] [2022-07-12 18:39:27,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:39:27,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:39:27,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:39:27,370 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:39:27,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:39:27,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078633498] [2022-07-12 18:39:27,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078633498] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:39:27,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553800804] [2022-07-12 18:39:27,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:39:27,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:39:27,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:39:27,374 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:39:27,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-12 18:39:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:39:27,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 86 conjunts are in the unsatisfiable core [2022-07-12 18:39:27,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:39:27,580 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 18:39:27,583 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 18:39:27,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:39:27,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 18:39:27,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:39:27,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 18:39:27,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:39:27,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:39:27,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:39:27,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:39:27,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:39:27,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:39:27,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:39:27,651 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:39:27,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-07-12 18:39:27,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:39:27,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:39:27,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:39:27,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-12 18:39:27,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:39:27,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:39:27,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:39:27,671 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:39:27,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-07-12 18:39:27,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:39:27,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:39:27,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:39:27,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-12 18:39:27,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:39:27,774 INFO L356 Elim1Store]: treesize reduction 44, result has 38.0 percent of original size [2022-07-12 18:39:27,775 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 3 case distinctions, treesize of input 32 treesize of output 40 [2022-07-12 18:39:27,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:39:27,811 INFO L356 Elim1Store]: treesize reduction 36, result has 49.3 percent of original size [2022-07-12 18:39:27,811 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 35 treesize of output 51 [2022-07-12 18:39:28,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:39:28,075 INFO L356 Elim1Store]: treesize reduction 144, result has 28.4 percent of original size [2022-07-12 18:39:28,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 125 treesize of output 139 [2022-07-12 18:39:28,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:39:28,135 INFO L356 Elim1Store]: treesize reduction 140, result has 30.3 percent of original size [2022-07-12 18:39:28,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 159 treesize of output 177 [2022-07-12 18:39:28,978 INFO L356 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-07-12 18:39:28,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 196 treesize of output 192 [2022-07-12 18:39:28,996 INFO L356 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-07-12 18:39:28,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 198 treesize of output 190 [2022-07-12 18:39:29,047 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-12 18:39:29,053 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 5 [2022-07-12 18:39:29,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 18:39:29,160 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 5 treesize of output 3 [2022-07-12 18:39:29,164 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-12 18:39:29,173 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 15 treesize of output 7 [2022-07-12 18:39:29,182 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 15 treesize of output 7 [2022-07-12 18:39:29,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 18:39:29,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:39:29,205 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 13 treesize of output 7 [2022-07-12 18:39:29,210 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 17 treesize of output 9 [2022-07-12 18:39:29,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:39:29,221 INFO L356 Elim1Store]: treesize reduction 11, result has 42.1 percent of original size [2022-07-12 18:39:29,221 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 58 treesize of output 50 [2022-07-12 18:39:29,243 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 18:39:29,278 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 18:39:29,281 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 18:39:29,282 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-12 18:39:29,301 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:39:29,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 36 [2022-07-12 18:39:29,310 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:39:29,310 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 28 treesize of output 34 [2022-07-12 18:39:29,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:39:29,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 35 treesize of output 34 [2022-07-12 18:39:29,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:39:29,332 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 39 treesize of output 38 [2022-07-12 18:39:29,460 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:39:29,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 38 [2022-07-12 18:39:29,466 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:39:29,466 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 26 [2022-07-12 18:39:29,680 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:39:29,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:39:32,964 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3494 Int) (v_ArrVal_3493 Int)) (or (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (forall ((v_ArrVal_3497 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base|) (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| 4) v_ArrVal_3494)) |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3497) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (= (select .cse0 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0) (= (select (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)))) (forall ((v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3501 Int)) (not (= (select (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base|) (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| 4) v_ArrVal_3493)) |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3501) |ULTIMATE.start_main_~x~1#1.offset|) 0))) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)))) (forall ((|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3494 Int) (v_ArrVal_3493 Int)) (or (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)) (forall ((v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3501 Int)) (let ((.cse1 (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base|) (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| 4) v_ArrVal_3493)) |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (= (select .cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0) (not (= (select (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3501) |ULTIMATE.start_main_~x~1#1.offset|) 0))))) (forall ((v_ArrVal_3497 (Array Int Int))) (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base|) (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| 4) v_ArrVal_3494)) |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3497) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|))))) is different from false [2022-07-12 18:39:33,006 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_26| Int)) (or (forall ((|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3494 Int) (v_ArrVal_3493 Int)) (or (forall ((v_ArrVal_3497 (Array Int Int))) (let ((.cse0 (select (store (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_26| 4) v_ArrVal_3494))) |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3497) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (= (select (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (= (select .cse0 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0)))) (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (forall ((v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3501 Int)) (not (= (select (store (select (store (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|))) (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_26| 4) v_ArrVal_3493))) |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3501) |ULTIMATE.start_main_~x~1#1.offset|) 0))) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)))) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_26| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|))))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_26| Int)) (or (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_26| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|))) (forall ((|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3494 Int) (v_ArrVal_3493 Int)) (or (forall ((v_ArrVal_3497 (Array Int Int))) (= (select (store (select (store (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse3 (store (select |c_#memory_$Pointer$.base| .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_26| 4) v_ArrVal_3494))) |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3497) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)) (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (forall ((v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3501 Int)) (let ((.cse4 (select (store (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|))) (store |c_#memory_$Pointer$.offset| .cse5 (store (select |c_#memory_$Pointer$.offset| .cse5) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_26| 4) v_ArrVal_3493))) |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (= (select .cse4 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0) (not (= (select (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3501) |ULTIMATE.start_main_~x~1#1.offset|) 0))))) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0))))))) is different from false [2022-07-12 18:39:33,163 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3487 Int)) (or (forall ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_26| Int)) (or (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_26| v_ArrVal_3487)) (forall ((|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3494 Int) (v_ArrVal_3493 Int)) (or (forall ((v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3501 Int)) (not (= (select (store (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3487)))) (store .cse0 |c_ULTIMATE.start_main_#t~mem7#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem7#1.base|) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_26| 4) v_ArrVal_3493))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3501) |ULTIMATE.start_main_~x~1#1.offset|) 0))) (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (forall ((v_ArrVal_3497 (Array Int Int))) (let ((.cse1 (select (store (let ((.cse2 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_#t~mem7#1.base|)))) (store .cse2 |c_ULTIMATE.start_main_#t~mem7#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem7#1.base|) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_26| 4) v_ArrVal_3494))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3497) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (= (select .cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0) (= (select (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)))) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)))))) (not (<= v_ArrVal_3487 |c_ULTIMATE.start_main_#t~mem7#1.offset|)))) (forall ((v_ArrVal_3487 Int)) (or (forall ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_26| Int)) (or (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_26| v_ArrVal_3487)) (forall ((|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3494 Int) (v_ArrVal_3493 Int)) (or (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (forall ((v_ArrVal_3497 (Array Int Int))) (= (select (store (select (store (let ((.cse3 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_#t~mem7#1.base|)))) (store .cse3 |c_ULTIMATE.start_main_#t~mem7#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem7#1.base|) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_26| 4) v_ArrVal_3494))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3497) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)) (forall ((v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3501 Int)) (let ((.cse4 (select (store (let ((.cse5 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3487)))) (store .cse5 |c_ULTIMATE.start_main_#t~mem7#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem7#1.base|) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_26| 4) v_ArrVal_3493))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (= (select .cse4 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0) (not (= (select (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3501) |ULTIMATE.start_main_~x~1#1.offset|) 0))))) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)))))) (not (<= v_ArrVal_3487 |c_ULTIMATE.start_main_#t~mem7#1.offset|))))) is different from false [2022-07-12 18:39:33,266 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3497 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3501 Int) (v_ArrVal_3487 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3494 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_26| Int) (v_ArrVal_3493 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse3 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_26| 4))) (let ((.cse0 (select (store (let ((.cse4 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3487)))) (store .cse4 .cse2 (store (select .cse4 .cse2) .cse3 v_ArrVal_3493))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (not (= (select (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3501) |ULTIMATE.start_main_~x~1#1.offset|) 0)) (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_26| v_ArrVal_3487)) (= (select (store (select (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| .cse2)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_ArrVal_3494))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3497) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (= (select .cse0 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0) (< (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_3487) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)))))) (forall ((|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3497 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3501 Int) (v_ArrVal_3487 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3494 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_26| Int) (v_ArrVal_3493 Int)) (let ((.cse7 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_26| 4)) (.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse8 (select (store (let ((.cse9 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| .cse6)))) (store .cse9 .cse6 (store (select .cse9 .cse6) .cse7 v_ArrVal_3494))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3497) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (not (= (select (store (select (store (let ((.cse5 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3487)))) (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 v_ArrVal_3493))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3501) |ULTIMATE.start_main_~x~1#1.offset|) 0)) (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_26| v_ArrVal_3487)) (= (select (store .cse8 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (= (select .cse8 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0) (< (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_3487) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0))))))) is different from false [2022-07-12 18:39:34,763 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3479 Int) (v_ArrVal_3501 Int) (v_ArrVal_3487 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3486 Int) (v_ArrVal_3483 Int) (v_ArrVal_3494 Int) (v_ArrVal_3493 Int) (v_ArrVal_3480 Int) (|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3497 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3498 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_26| Int)) (let ((.cse10 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse2 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_26| 4)) (.cse1 (select .cse10 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse6 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (let ((.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse7 (select (store (let ((.cse8 (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse10 .cse5 v_ArrVal_3480) .cse6 v_ArrVal_3486)))) (store .cse9 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse9 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| .cse1))))) (store .cse8 .cse1 (store (select .cse8 .cse1) .cse2 v_ArrVal_3494))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3497) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (not (= (select (store (select (store (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse4 .cse5 v_ArrVal_3479) .cse6 v_ArrVal_3483)))) (store .cse3 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse3 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3487))))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_3493))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3501) |ULTIMATE.start_main_~x~1#1.offset|) 0)) (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (= (select (store .cse7 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_26| v_ArrVal_3487)) (< (select .cse4 |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_3487) (= (select .cse7 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0))))))) (forall ((v_ArrVal_3479 Int) (v_ArrVal_3501 Int) (v_ArrVal_3487 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3486 Int) (v_ArrVal_3483 Int) (v_ArrVal_3494 Int) (v_ArrVal_3493 Int) (v_ArrVal_3480 Int) (|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3497 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3498 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_26| Int)) (let ((.cse16 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse13 (select .cse16 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse14 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_26| 4)) (.cse19 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse17 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse18 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (let ((.cse11 (select (store (let ((.cse20 (let ((.cse21 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse19 .cse17 v_ArrVal_3479) .cse18 v_ArrVal_3483)))) (store .cse21 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse21 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3487))))) (store .cse20 .cse13 (store (select .cse20 .cse13) .cse14 v_ArrVal_3493))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (not (= (select (store .cse11 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3501) |ULTIMATE.start_main_~x~1#1.offset|) 0)) (= (select .cse11 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0) (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (= (select (store (select (store (let ((.cse12 (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse16 .cse17 v_ArrVal_3480) .cse18 v_ArrVal_3486)))) (store .cse15 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse15 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| .cse13))))) (store .cse12 .cse13 (store (select .cse12 .cse13) .cse14 v_ArrVal_3494))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3497) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_26| v_ArrVal_3487)) (< (select .cse19 |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_3487) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)))))))) is different from false [2022-07-12 18:39:34,888 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3476 Int)) (or (forall ((v_ArrVal_3479 Int) (v_ArrVal_3501 Int) (v_ArrVal_3487 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3486 Int) (v_ArrVal_3483 Int) (v_ArrVal_3494 Int) (v_ArrVal_3493 Int) (v_ArrVal_3480 Int) (|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3497 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3498 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_26| Int)) (let ((.cse1 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_26| 4)) (.cse3 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse4 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (let ((.cse5 (select (store (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse3 v_ArrVal_3480) .cse4 v_ArrVal_3486)))) (store .cse7 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse7 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|))))) (store .cse6 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~x~0#1.base|) .cse1 v_ArrVal_3494))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3497) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (not (= (select (store (select (store (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3476) .cse3 v_ArrVal_3479) .cse4 v_ArrVal_3483)))) (store .cse2 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse2 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3487))))) (store .cse0 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) .cse1 v_ArrVal_3493))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3501) |ULTIMATE.start_main_~x~1#1.offset|) 0)) (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_26| v_ArrVal_3487)) (= (select (store .cse5 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (= (select .cse5 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)) (< v_ArrVal_3476 v_ArrVal_3487))))) (not (<= v_ArrVal_3476 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_3476 Int)) (or (not (<= v_ArrVal_3476 |c_ULTIMATE.start_main_~x~0#1.offset|)) (forall ((v_ArrVal_3479 Int) (v_ArrVal_3501 Int) (v_ArrVal_3487 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3486 Int) (v_ArrVal_3483 Int) (v_ArrVal_3494 Int) (v_ArrVal_3493 Int) (v_ArrVal_3480 Int) (|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3497 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3498 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_26| Int)) (let ((.cse10 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_26| 4)) (.cse12 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse13 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (let ((.cse8 (select (store (let ((.cse14 (let ((.cse15 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3476) .cse12 v_ArrVal_3479) .cse13 v_ArrVal_3483)))) (store .cse15 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse15 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3487))))) (store .cse14 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~x~0#1.base|) .cse10 v_ArrVal_3493))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (not (= (select (store .cse8 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3501) |ULTIMATE.start_main_~x~1#1.offset|) 0)) (= (select .cse8 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0) (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_26| v_ArrVal_3487)) (= (select (store (select (store (let ((.cse9 (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse12 v_ArrVal_3480) .cse13 v_ArrVal_3486)))) (store .cse11 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse11 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|))))) (store .cse9 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~x~0#1.base|) .cse10 v_ArrVal_3494))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3497) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)) (< v_ArrVal_3476 v_ArrVal_3487)))))))) is different from false [2022-07-12 18:39:35,140 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3476 Int) (v_ArrVal_3473 Int) (v_ArrVal_3471 Int)) (or (forall ((v_ArrVal_3479 Int) (v_ArrVal_3501 Int) (v_ArrVal_3487 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3486 Int) (v_ArrVal_3483 Int) (v_ArrVal_3494 Int) (v_ArrVal_3493 Int) (v_ArrVal_3480 Int) (|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3497 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3498 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_26| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_26| 4)) (.cse4 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 16)) (.cse5 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse6 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (let ((.cse0 (select (store (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse4 v_ArrVal_3471) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse5 v_ArrVal_3480) .cse6 v_ArrVal_3486)))) (store .cse8 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse8 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|))))) (store .cse7 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~x~0#1.base|) .cse2 v_ArrVal_3494))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3497) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (= (select (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select (store (select (store (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse4 v_ArrVal_3473) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3476) .cse5 v_ArrVal_3479) .cse6 v_ArrVal_3483)))) (store .cse3 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse3 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3487))))) (store .cse1 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) .cse2 v_ArrVal_3493))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3501) |ULTIMATE.start_main_~x~1#1.offset|) 0)) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_26| v_ArrVal_3487)) (= (select .cse0 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)) (< v_ArrVal_3476 v_ArrVal_3487))))) (not (<= v_ArrVal_3476 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_3476 Int) (v_ArrVal_3473 Int) (v_ArrVal_3471 Int)) (or (not (<= v_ArrVal_3476 |c_ULTIMATE.start_main_~x~0#1.offset|)) (forall ((v_ArrVal_3479 Int) (v_ArrVal_3501 Int) (v_ArrVal_3487 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3486 Int) (v_ArrVal_3483 Int) (v_ArrVal_3494 Int) (v_ArrVal_3493 Int) (v_ArrVal_3480 Int) (|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3497 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3498 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_26| Int)) (let ((.cse10 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_26| 4)) (.cse12 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 16)) (.cse13 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse14 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (let ((.cse15 (select (store (let ((.cse16 (let ((.cse17 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse12 v_ArrVal_3473) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3476) .cse13 v_ArrVal_3479) .cse14 v_ArrVal_3483)))) (store .cse17 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse17 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3487))))) (store .cse16 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse16 |c_ULTIMATE.start_main_~x~0#1.base|) .cse10 v_ArrVal_3493))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (= (select (store (select (store (let ((.cse9 (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse12 v_ArrVal_3471) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse13 v_ArrVal_3480) .cse14 v_ArrVal_3486)))) (store .cse11 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse11 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|))))) (store .cse9 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~x~0#1.base|) .cse10 v_ArrVal_3494))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3497) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select (store .cse15 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3501) |ULTIMATE.start_main_~x~1#1.offset|) 0)) (= (select .cse15 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_26| v_ArrVal_3487)) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)) (< v_ArrVal_3476 v_ArrVal_3487)))))))) is different from false [2022-07-12 18:39:35,207 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:35,208 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:35,208 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:35,214 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:35,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:39:35,231 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:35,232 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:35,232 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:35,233 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:35,244 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:35,244 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:35,245 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:35,260 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:35,280 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:35,790 INFO L356 Elim1Store]: treesize reduction 140, result has 45.5 percent of original size [2022-07-12 18:39:35,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 152 treesize of output 131 [2022-07-12 18:39:35,812 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:35,812 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:35,813 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:35,813 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:35,814 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:35,815 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:35,815 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:35,816 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:35,816 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:35,817 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:35,817 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:35,818 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:35,820 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:35,921 INFO L356 Elim1Store]: treesize reduction 187, result has 38.7 percent of original size [2022-07-12 18:39:35,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 302 treesize of output 143 [2022-07-12 18:39:35,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:39:35,933 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:35,933 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:35,933 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:35,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:39:35,935 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:35,935 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:35,936 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:35,937 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:35,941 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:35,942 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:35,943 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:35,960 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:39:35,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 116 treesize of output 132 [2022-07-12 18:39:35,974 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:39:35,974 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 160 treesize of output 148 [2022-07-12 18:39:35,990 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:35,990 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:35,992 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:35,993 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:35,994 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:35,995 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:35,996 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:35,998 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:35,998 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:36,001 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:36,072 INFO L356 Elim1Store]: treesize reduction 8, result has 92.4 percent of original size [2022-07-12 18:39:36,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 131 treesize of output 201 [2022-07-12 18:39:36,095 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:39:36,095 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 34 treesize of output 38 [2022-07-12 18:39:36,107 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:36,111 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 18:39:36,353 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:36,353 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:36,354 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:36,354 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:36,355 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:36,355 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:36,356 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:36,356 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:36,357 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:36,357 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:36,358 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:36,358 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:36,366 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:36,373 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:36,408 INFO L356 Elim1Store]: treesize reduction 114, result has 0.9 percent of original size [2022-07-12 18:39:36,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 14 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 303 treesize of output 1 [2022-07-12 18:39:36,413 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-12 18:39:36,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553800804] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:39:36,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:39:36,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 23] total 50 [2022-07-12 18:39:36,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746955913] [2022-07-12 18:39:36,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:39:36,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-12 18:39:36,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:39:36,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-12 18:39:36,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1550, Unknown=84, NotChecked=616, Total=2450 [2022-07-12 18:39:36,415 INFO L87 Difference]: Start difference. First operand 282 states and 330 transitions. Second operand has 50 states, 50 states have (on average 2.2) internal successors, (110), 50 states have internal predecessors, (110), 0 states have call successors, (0), 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 18:39:36,498 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))) (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 0) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (forall ((v_ArrVal_3476 Int) (v_ArrVal_3473 Int) (v_ArrVal_3471 Int)) (or (forall ((v_ArrVal_3479 Int) (v_ArrVal_3501 Int) (v_ArrVal_3487 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3486 Int) (v_ArrVal_3483 Int) (v_ArrVal_3494 Int) (v_ArrVal_3493 Int) (v_ArrVal_3480 Int) (|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3497 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3498 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_26| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_26| 4)) (.cse5 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 16)) (.cse6 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse7 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (let ((.cse1 (select (store (let ((.cse8 (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse5 v_ArrVal_3471) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse6 v_ArrVal_3480) .cse7 v_ArrVal_3486)))) (store .cse9 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse9 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|))))) (store .cse8 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~x~0#1.base|) .cse3 v_ArrVal_3494))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3497) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (= (select (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select (store (select (store (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse5 v_ArrVal_3473) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3476) .cse6 v_ArrVal_3479) .cse7 v_ArrVal_3483)))) (store .cse4 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse4 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3487))))) (store .cse2 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) .cse3 v_ArrVal_3493))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3501) |ULTIMATE.start_main_~x~1#1.offset|) 0)) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_26| v_ArrVal_3487)) (= (select .cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)) (< v_ArrVal_3476 v_ArrVal_3487))))) (not (<= v_ArrVal_3476 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 0) (forall ((v_ArrVal_3476 Int) (v_ArrVal_3473 Int) (v_ArrVal_3471 Int)) (or (not (<= v_ArrVal_3476 |c_ULTIMATE.start_main_~x~0#1.offset|)) (forall ((v_ArrVal_3479 Int) (v_ArrVal_3501 Int) (v_ArrVal_3487 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3486 Int) (v_ArrVal_3483 Int) (v_ArrVal_3494 Int) (v_ArrVal_3493 Int) (v_ArrVal_3480 Int) (|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3497 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3498 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_26| Int)) (let ((.cse11 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_26| 4)) (.cse13 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 16)) (.cse14 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse15 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (let ((.cse16 (select (store (let ((.cse17 (let ((.cse18 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse13 v_ArrVal_3473) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3476) .cse14 v_ArrVal_3479) .cse15 v_ArrVal_3483)))) (store .cse18 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse18 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3487))))) (store .cse17 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse17 |c_ULTIMATE.start_main_~x~0#1.base|) .cse11 v_ArrVal_3493))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (= (select (store (select (store (let ((.cse10 (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse13 v_ArrVal_3471) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse14 v_ArrVal_3480) .cse15 v_ArrVal_3486)))) (store .cse12 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse12 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|))))) (store .cse10 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~x~0#1.base|) .cse11 v_ArrVal_3494))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3497) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select (store .cse16 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3501) |ULTIMATE.start_main_~x~1#1.offset|) 0)) (= (select .cse16 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_26| v_ArrVal_3487)) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)) (< v_ArrVal_3476 v_ArrVal_3487))))))) (= |c_ULTIMATE.start_main_~first~0#1.base| 0) (= |c_ULTIMATE.start_main_~first~0#1.offset| 0))) is different from false [2022-07-12 18:39:36,544 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))) (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 0) (forall ((v_ArrVal_3476 Int)) (or (forall ((v_ArrVal_3479 Int) (v_ArrVal_3501 Int) (v_ArrVal_3487 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3486 Int) (v_ArrVal_3483 Int) (v_ArrVal_3494 Int) (v_ArrVal_3493 Int) (v_ArrVal_3480 Int) (|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3497 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3498 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_26| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_26| 4)) (.cse4 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse5 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (let ((.cse6 (select (store (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse4 v_ArrVal_3480) .cse5 v_ArrVal_3486)))) (store .cse8 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse8 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|))))) (store .cse7 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~x~0#1.base|) .cse2 v_ArrVal_3494))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3497) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (not (= (select (store (select (store (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3476) .cse4 v_ArrVal_3479) .cse5 v_ArrVal_3483)))) (store .cse3 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse3 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3487))))) (store .cse1 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) .cse2 v_ArrVal_3493))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3501) |ULTIMATE.start_main_~x~1#1.offset|) 0)) (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_26| v_ArrVal_3487)) (= (select (store .cse6 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (= (select .cse6 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)) (< v_ArrVal_3476 v_ArrVal_3487))))) (not (<= v_ArrVal_3476 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_3476 Int)) (or (not (<= v_ArrVal_3476 |c_ULTIMATE.start_main_~x~0#1.offset|)) (forall ((v_ArrVal_3479 Int) (v_ArrVal_3501 Int) (v_ArrVal_3487 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3486 Int) (v_ArrVal_3483 Int) (v_ArrVal_3494 Int) (v_ArrVal_3493 Int) (v_ArrVal_3480 Int) (|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3497 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3498 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_26| Int)) (let ((.cse11 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_26| 4)) (.cse13 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse14 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (let ((.cse9 (select (store (let ((.cse15 (let ((.cse16 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3476) .cse13 v_ArrVal_3479) .cse14 v_ArrVal_3483)))) (store .cse16 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse16 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3487))))) (store .cse15 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse15 |c_ULTIMATE.start_main_~x~0#1.base|) .cse11 v_ArrVal_3493))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (not (= (select (store .cse9 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3501) |ULTIMATE.start_main_~x~1#1.offset|) 0)) (= (select .cse9 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0) (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_26| v_ArrVal_3487)) (= (select (store (select (store (let ((.cse10 (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse13 v_ArrVal_3480) .cse14 v_ArrVal_3486)))) (store .cse12 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse12 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|))))) (store .cse10 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~x~0#1.base|) .cse11 v_ArrVal_3494))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3497) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)) (< v_ArrVal_3476 v_ArrVal_3487))))))) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 0))) is different from false [2022-07-12 18:39:36,554 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))) (and (= (select .cse0 .cse1) 0) (= (select .cse2 |c_ULTIMATE.start_main_~x~0#1.offset|) 0) (forall ((v_ArrVal_3479 Int) (v_ArrVal_3501 Int) (v_ArrVal_3487 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3486 Int) (v_ArrVal_3483 Int) (v_ArrVal_3494 Int) (v_ArrVal_3493 Int) (v_ArrVal_3480 Int) (|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3497 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3498 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_26| Int)) (let ((.cse13 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_26| 4)) (.cse4 (select .cse13 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse8 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse9 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (let ((.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse10 (select (store (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse13 .cse8 v_ArrVal_3480) .cse9 v_ArrVal_3486)))) (store .cse12 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse12 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| .cse4))))) (store .cse11 .cse4 (store (select .cse11 .cse4) .cse5 v_ArrVal_3494))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3497) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (not (= (select (store (select (store (let ((.cse3 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse7 .cse8 v_ArrVal_3479) .cse9 v_ArrVal_3483)))) (store .cse6 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse6 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3487))))) (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 v_ArrVal_3493))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3501) |ULTIMATE.start_main_~x~1#1.offset|) 0)) (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (= (select (store .cse10 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_26| v_ArrVal_3487)) (< (select .cse7 |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_3487) (= (select .cse10 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0))))))) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (= (select .cse2 .cse1) 0) (forall ((v_ArrVal_3479 Int) (v_ArrVal_3501 Int) (v_ArrVal_3487 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3486 Int) (v_ArrVal_3483 Int) (v_ArrVal_3494 Int) (v_ArrVal_3493 Int) (v_ArrVal_3480 Int) (|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3497 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3498 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_26| Int)) (let ((.cse19 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse16 (select .cse19 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse17 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_26| 4)) (.cse22 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse20 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse21 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (let ((.cse14 (select (store (let ((.cse23 (let ((.cse24 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse22 .cse20 v_ArrVal_3479) .cse21 v_ArrVal_3483)))) (store .cse24 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse24 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3487))))) (store .cse23 .cse16 (store (select .cse23 .cse16) .cse17 v_ArrVal_3493))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (not (= (select (store .cse14 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3501) |ULTIMATE.start_main_~x~1#1.offset|) 0)) (= (select .cse14 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0) (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (= (select (store (select (store (let ((.cse15 (let ((.cse18 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse19 .cse20 v_ArrVal_3480) .cse21 v_ArrVal_3486)))) (store .cse18 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse18 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| .cse16))))) (store .cse15 .cse16 (store (select .cse15 .cse16) .cse17 v_ArrVal_3494))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3497) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_26| v_ArrVal_3487)) (< (select .cse22 |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_3487) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0))))))))) is different from false [2022-07-12 18:39:36,576 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))) (and (= (select .cse0 .cse1) 0) (= (select .cse2 |c_ULTIMATE.start_main_~x~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3497 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3501 Int) (v_ArrVal_3487 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3494 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_26| Int) (v_ArrVal_3493 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse6 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_26| 4))) (let ((.cse3 (select (store (let ((.cse7 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3487)))) (store .cse7 .cse5 (store (select .cse7 .cse5) .cse6 v_ArrVal_3493))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (not (= (select (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3501) |ULTIMATE.start_main_~x~1#1.offset|) 0)) (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_26| v_ArrVal_3487)) (= (select (store (select (store (let ((.cse4 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| .cse5)))) (store .cse4 .cse5 (store (select .cse4 .cse5) .cse6 v_ArrVal_3494))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3497) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (= (select .cse3 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0) (< (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_3487) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)))))) (= (select .cse2 .cse1) 0) (forall ((|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3497 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3501 Int) (v_ArrVal_3487 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3494 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_26| Int) (v_ArrVal_3493 Int)) (let ((.cse10 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_26| 4)) (.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse11 (select (store (let ((.cse12 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| .cse9)))) (store .cse12 .cse9 (store (select .cse12 .cse9) .cse10 v_ArrVal_3494))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3497) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (not (= (select (store (select (store (let ((.cse8 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3487)))) (store .cse8 .cse9 (store (select .cse8 .cse9) .cse10 v_ArrVal_3493))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3501) |ULTIMATE.start_main_~x~1#1.offset|) 0)) (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_26| v_ArrVal_3487)) (= (select (store .cse11 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (= (select .cse11 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0) (< (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_3487) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)))))))) is different from false [2022-07-12 18:39:36,584 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse16 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse15 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))) (let ((.cse0 (= (select .cse16 .cse15) 0)) (.cse1 (= (select .cse16 |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse2 (select .cse14 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse3 (= (select .cse14 .cse15) 0))) (and .cse0 (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) .cse1 (or (and .cse0 (= .cse2 0) .cse1 .cse3) (= |c_ULTIMATE.start_main_~y~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (<= .cse2 |c_ULTIMATE.start_main_~x~0#1.offset|) (forall ((|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3497 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3501 Int) (v_ArrVal_3487 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3494 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_26| Int) (v_ArrVal_3493 Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse7 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_26| 4))) (let ((.cse4 (select (store (let ((.cse8 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3487)))) (store .cse8 .cse6 (store (select .cse8 .cse6) .cse7 v_ArrVal_3493))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (not (= (select (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3501) |ULTIMATE.start_main_~x~1#1.offset|) 0)) (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_26| v_ArrVal_3487)) (= (select (store (select (store (let ((.cse5 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| .cse6)))) (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 v_ArrVal_3494))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3497) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (= (select .cse4 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0) (< (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_3487) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)))))) .cse3 (forall ((|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3497 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3501 Int) (v_ArrVal_3487 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3494 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_26| Int) (v_ArrVal_3493 Int)) (let ((.cse11 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_26| 4)) (.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse12 (select (store (let ((.cse13 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| .cse10)))) (store .cse13 .cse10 (store (select .cse13 .cse10) .cse11 v_ArrVal_3494))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3497) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (not (= (select (store (select (store (let ((.cse9 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3487)))) (store .cse9 .cse10 (store (select .cse9 .cse10) .cse11 v_ArrVal_3493))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3501) |ULTIMATE.start_main_~x~1#1.offset|) 0)) (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_26| v_ArrVal_3487)) (= (select (store .cse12 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (= (select .cse12 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0) (< (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_3487) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0))))))))) is different from false [2022-07-12 18:39:38,605 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse12 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse11 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))) (let ((.cse0 (= (select .cse12 .cse11) 0)) (.cse2 (select .cse12 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse3 (select .cse10 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (= (select .cse10 .cse11) 0))) (and (or (and (= |c_ULTIMATE.start_main_#t~mem7#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0 (= |c_ULTIMATE.start_main_#t~mem7#1.offset| 0) .cse1) (= |c_ULTIMATE.start_main_~y~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) .cse0 (= .cse2 |c_ULTIMATE.start_main_#t~mem7#1.base|) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (= .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) (<= |c_ULTIMATE.start_main_#t~mem7#1.offset| .cse3) (<= .cse3 |c_ULTIMATE.start_main_~x~0#1.offset|) .cse1 (forall ((v_ArrVal_3487 Int)) (or (forall ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_26| Int)) (or (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_26| v_ArrVal_3487)) (forall ((|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3494 Int) (v_ArrVal_3493 Int)) (or (forall ((v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3501 Int)) (not (= (select (store (select (store (let ((.cse4 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3487)))) (store .cse4 |c_ULTIMATE.start_main_#t~mem7#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem7#1.base|) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_26| 4) v_ArrVal_3493))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3501) |ULTIMATE.start_main_~x~1#1.offset|) 0))) (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (forall ((v_ArrVal_3497 (Array Int Int))) (let ((.cse5 (select (store (let ((.cse6 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_#t~mem7#1.base|)))) (store .cse6 |c_ULTIMATE.start_main_#t~mem7#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem7#1.base|) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_26| 4) v_ArrVal_3494))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3497) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (= (select .cse5 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0) (= (select (store .cse5 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)))) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)))))) (not (<= v_ArrVal_3487 |c_ULTIMATE.start_main_#t~mem7#1.offset|)))) (forall ((v_ArrVal_3487 Int)) (or (forall ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_26| Int)) (or (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_26| v_ArrVal_3487)) (forall ((|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3494 Int) (v_ArrVal_3493 Int)) (or (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (forall ((v_ArrVal_3497 (Array Int Int))) (= (select (store (select (store (let ((.cse7 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_#t~mem7#1.base|)))) (store .cse7 |c_ULTIMATE.start_main_#t~mem7#1.base| (store (select .cse7 |c_ULTIMATE.start_main_#t~mem7#1.base|) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_26| 4) v_ArrVal_3494))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3497) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)) (forall ((v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3501 Int)) (let ((.cse8 (select (store (let ((.cse9 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3487)))) (store .cse9 |c_ULTIMATE.start_main_#t~mem7#1.base| (store (select .cse9 |c_ULTIMATE.start_main_#t~mem7#1.base|) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_26| 4) v_ArrVal_3493))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (= (select .cse8 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0) (not (= (select (store .cse8 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3501) |ULTIMATE.start_main_~x~1#1.offset|) 0))))) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)))))) (not (<= v_ArrVal_3487 |c_ULTIMATE.start_main_#t~mem7#1.offset|))))))) is different from false [2022-07-12 18:39:46,927 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))) (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 0) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (forall ((v_ArrVal_3476 Int) (v_ArrVal_3473 Int) (v_ArrVal_3471 Int)) (or (forall ((v_ArrVal_3479 Int) (v_ArrVal_3501 Int) (v_ArrVal_3487 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3486 Int) (v_ArrVal_3483 Int) (v_ArrVal_3494 Int) (v_ArrVal_3493 Int) (v_ArrVal_3480 Int) (|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3497 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3498 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_26| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_26| 4)) (.cse5 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 16)) (.cse6 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse7 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (let ((.cse1 (select (store (let ((.cse8 (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse5 v_ArrVal_3471) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse6 v_ArrVal_3480) .cse7 v_ArrVal_3486)))) (store .cse9 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse9 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|))))) (store .cse8 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~x~0#1.base|) .cse3 v_ArrVal_3494))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3497) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (= (select (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select (store (select (store (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse5 v_ArrVal_3473) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3476) .cse6 v_ArrVal_3479) .cse7 v_ArrVal_3483)))) (store .cse4 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse4 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3487))))) (store .cse2 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) .cse3 v_ArrVal_3493))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3501) |ULTIMATE.start_main_~x~1#1.offset|) 0)) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_26| v_ArrVal_3487)) (= (select .cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)) (< v_ArrVal_3476 v_ArrVal_3487))))) (not (<= v_ArrVal_3476 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 0) (forall ((v_ArrVal_3476 Int) (v_ArrVal_3473 Int) (v_ArrVal_3471 Int)) (or (not (<= v_ArrVal_3476 |c_ULTIMATE.start_main_~x~0#1.offset|)) (forall ((v_ArrVal_3479 Int) (v_ArrVal_3501 Int) (v_ArrVal_3487 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3486 Int) (v_ArrVal_3483 Int) (v_ArrVal_3494 Int) (v_ArrVal_3493 Int) (v_ArrVal_3480 Int) (|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3497 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3498 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_26| Int)) (let ((.cse11 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_26| 4)) (.cse13 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 16)) (.cse14 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse15 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (let ((.cse16 (select (store (let ((.cse17 (let ((.cse18 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse13 v_ArrVal_3473) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3476) .cse14 v_ArrVal_3479) .cse15 v_ArrVal_3483)))) (store .cse18 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse18 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3487))))) (store .cse17 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse17 |c_ULTIMATE.start_main_~x~0#1.base|) .cse11 v_ArrVal_3493))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (= (select (store (select (store (let ((.cse10 (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse13 v_ArrVal_3471) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse14 v_ArrVal_3480) .cse15 v_ArrVal_3486)))) (store .cse12 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse12 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|))))) (store .cse10 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~x~0#1.base|) .cse11 v_ArrVal_3494))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3497) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select (store .cse16 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3501) |ULTIMATE.start_main_~x~1#1.offset|) 0)) (= (select .cse16 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_26| v_ArrVal_3487)) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)) (< v_ArrVal_3476 v_ArrVal_3487))))))))) is different from false [2022-07-12 18:39:48,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:39:48,441 INFO L93 Difference]: Finished difference Result 479 states and 567 transitions. [2022-07-12 18:39:48,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-12 18:39:48,442 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.2) internal successors, (110), 50 states have internal predecessors, (110), 0 states have call successors, (0), 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 46 [2022-07-12 18:39:48,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:39:48,443 INFO L225 Difference]: With dead ends: 479 [2022-07-12 18:39:48,443 INFO L226 Difference]: Without dead ends: 479 [2022-07-12 18:39:48,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 67 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 886 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=402, Invalid=3069, Unknown=125, NotChecked=1806, Total=5402 [2022-07-12 18:39:48,445 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 196 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 1502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 975 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:39:48,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 841 Invalid, 1502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 504 Invalid, 0 Unknown, 975 Unchecked, 0.3s Time] [2022-07-12 18:39:48,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2022-07-12 18:39:48,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 286. [2022-07-12 18:39:48,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 275 states have (on average 1.2145454545454546) internal successors, (334), 285 states have internal predecessors, (334), 0 states have call successors, (0), 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 18:39:48,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 334 transitions. [2022-07-12 18:39:48,450 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 334 transitions. Word has length 46 [2022-07-12 18:39:48,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:39:48,450 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 334 transitions. [2022-07-12 18:39:48,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.2) internal successors, (110), 50 states have internal predecessors, (110), 0 states have call successors, (0), 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 18:39:48,450 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 334 transitions. [2022-07-12 18:39:48,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-12 18:39:48,451 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:39:48,451 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:39:48,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-07-12 18:39:48,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:39:48,652 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:39:48,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:39:48,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1565727437, now seen corresponding path program 1 times [2022-07-12 18:39:48,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:39:48,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095078854] [2022-07-12 18:39:48,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:39:48,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:39:48,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:39:48,921 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:39:48,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:39:48,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095078854] [2022-07-12 18:39:48,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095078854] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:39:48,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658259005] [2022-07-12 18:39:48,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:39:48,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:39:48,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:39:48,924 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:39:48,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-12 18:39:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:39:49,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-12 18:39:49,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:39:49,135 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 18:39:49,174 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:39:49,174 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 18:39:49,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:39:49,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:39:49,227 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 18:39:49,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:39:49,241 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 18:39:49,275 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 19 treesize of output 18 [2022-07-12 18:39:49,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:39:49,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:39:49,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:39:49,312 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:39:49,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 48 [2022-07-12 18:39:49,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2022-07-12 18:39:49,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2022-07-12 18:39:49,491 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:39:49,492 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 19 [2022-07-12 18:39:49,495 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:39:49,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:39:49,504 INFO L356 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-07-12 18:39:49,504 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 16 treesize of output 15 [2022-07-12 18:39:49,555 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3671 (Array Int Int)) (v_ArrVal_3670 Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 16) v_ArrVal_3670))) (.cse2 (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~first~0#1.base|) .cse2))) (= (select (select .cse0 .cse1) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_3671) |c_ULTIMATE.start_main_~first~0#1.base|) .cse2)) .cse1)))) is different from false [2022-07-12 18:39:49,561 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:39:49,561 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 128 treesize of output 129 [2022-07-12 18:39:49,568 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:39:49,569 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 248 treesize of output 251 [2022-07-12 18:39:49,573 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 117 treesize of output 113 [2022-07-12 18:39:57,692 WARN L233 SmtUtils]: Spent 7.99s on a formula simplification. DAG size of input: 49 DAG size of output: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 18:40:15,391 WARN L233 SmtUtils]: Spent 11.35s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 18:40:17,433 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_arrayElimCell_245 Int) (v_ArrVal_3664 Int) (v_arrayElimCell_244 Int) (v_ArrVal_3661 Int) (v_ArrVal_3670 Int)) (let ((.cse12 (let ((.cse13 (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4) v_ArrVal_3661) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_3664)))) (store .cse14 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~last~0#1.base|) (+ |c_ULTIMATE.start_main_~last~0#1.offset| 12) |c_ULTIMATE.start_main_~x~0#1.base|))))) (store .cse13 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 16) v_ArrVal_3670))))) (let ((.cse10 (select (select .cse12 |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)))) (let ((.cse11 (select .cse12 .cse10))) (or (= .cse10 (select .cse11 v_arrayElimCell_245)) (= .cse10 (select .cse11 v_arrayElimCell_244))))))))) (and (or .cse0 (= |c_ULTIMATE.start_main_~last~0#1.base| |c_ULTIMATE.start_main_~first~0#1.base|)) (forall ((v_arrayElimCell_245 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3670 Int)) (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4) v_ArrVal_3661) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_3664)))) (store .cse5 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~last~0#1.base|) (+ |c_ULTIMATE.start_main_~last~0#1.offset| 12) |c_ULTIMATE.start_main_~x~0#1.base|))))) (store .cse4 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 16) v_ArrVal_3670))))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)))) (let ((.cse2 (select .cse3 .cse1))) (or (= .cse1 (select .cse2 v_arrayElimCell_245)) (= .cse1 (select .cse2 |c_ULTIMATE.start_main_~x~0#1.offset|))))))) (or (forall ((v_arrayElimCell_245 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3670 Int)) (let ((.cse7 (let ((.cse8 (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4) v_ArrVal_3661) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_3664)))) (store .cse9 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~last~0#1.base|) (+ |c_ULTIMATE.start_main_~last~0#1.offset| 12) |c_ULTIMATE.start_main_~x~0#1.base|))))) (store .cse8 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 16) v_ArrVal_3670))))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)))) (= .cse6 (select (select .cse7 .cse6) v_arrayElimCell_245))))) (not (= |c_ULTIMATE.start_main_~first~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (or .cse0 (= |c_ULTIMATE.start_main_~first~0#1.offset| |c_ULTIMATE.start_main_~last~0#1.offset|)))) is different from false [2022-07-12 18:40:17,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:40:18,230 INFO L356 Elim1Store]: treesize reduction 854, result has 32.2 percent of original size [2022-07-12 18:40:18,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 19 case distinctions, treesize of input 221552174 treesize of output 148338374