./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml', '-i', '../sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G valid-free) )\nCHECK( init(main()), LTL(G valid-deref) )\nCHECK( init(main()), LTL(G valid-memtrack) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '6e14aa3eeddc5d261248d26114db1375e0f229d6456e2c7754877a082dc10921'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 6e14aa3eeddc5d261248d26114db1375e0f229d6456e2c7754877a082dc10921 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 16:29:25,758 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 16:29:25,842 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-07 16:29:25,848 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 16:29:25,849 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 16:29:25,872 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 16:29:25,875 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 16:29:25,876 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 16:29:25,876 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 16:29:25,876 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 16:29:25,876 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 16:29:25,876 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 16:29:25,876 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 16:29:25,877 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 16:29:25,877 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 16:29:25,877 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 16:29:25,878 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 16:29:25,878 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 16:29:25,878 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 16:29:25,878 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 16:29:25,878 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 16:29:25,879 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 16:29:25,879 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 16:29:25,879 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 16:29:25,879 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 16:29:25,879 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 16:29:25,879 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 16:29:25,879 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 16:29:25,879 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 16:29:25,879 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 16:29:25,879 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 16:29:25,879 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 16:29:25,879 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 16:29:25,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:29:25,880 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 16:29:25,880 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 16:29:25,880 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 16:29:25,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 16:29:25,880 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 16:29:25,880 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 16:29:25,880 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 16:29:25,880 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 16:29:25,880 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 6e14aa3eeddc5d261248d26114db1375e0f229d6456e2c7754877a082dc10921 [2024-11-07 16:29:26,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 16:29:26,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 16:29:26,116 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 16:29:26,116 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 16:29:26,117 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 16:29:26,117 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i [2024-11-07 16:29:27,296 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 16:29:27,538 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 16:29:27,539 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i [2024-11-07 16:29:27,548 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0829bf195/b5b29eb94a994925b854d87b729d9c58/FLAG7cd209b6a [2024-11-07 16:29:27,855 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0829bf195/b5b29eb94a994925b854d87b729d9c58 [2024-11-07 16:29:27,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 16:29:27,858 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 16:29:27,859 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 16:29:27,859 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 16:29:27,862 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 16:29:27,863 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:29:27" (1/1) ... [2024-11-07 16:29:27,863 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53bf9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:27, skipping insertion in model container [2024-11-07 16:29:27,863 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:29:27" (1/1) ... [2024-11-07 16:29:27,891 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 16:29:28,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:29:28,053 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 16:29:28,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:29:28,096 INFO L204 MainTranslator]: Completed translation [2024-11-07 16:29:28,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:28 WrapperNode [2024-11-07 16:29:28,097 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 16:29:28,098 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 16:29:28,098 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 16:29:28,098 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 16:29:28,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:28" (1/1) ... [2024-11-07 16:29:28,109 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:28" (1/1) ... [2024-11-07 16:29:28,122 INFO L138 Inliner]: procedures = 123, calls = 49, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 150 [2024-11-07 16:29:28,122 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 16:29:28,123 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 16:29:28,123 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 16:29:28,123 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 16:29:28,129 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:28" (1/1) ... [2024-11-07 16:29:28,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:28" (1/1) ... [2024-11-07 16:29:28,131 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:28" (1/1) ... [2024-11-07 16:29:28,152 INFO L175 MemorySlicer]: Split 37 memory accesses to 2 slices as follows [2, 35]. 95 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 17 writes are split as follows [0, 17]. [2024-11-07 16:29:28,153 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:28" (1/1) ... [2024-11-07 16:29:28,153 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:28" (1/1) ... [2024-11-07 16:29:28,160 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:28" (1/1) ... [2024-11-07 16:29:28,162 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:28" (1/1) ... [2024-11-07 16:29:28,163 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:28" (1/1) ... [2024-11-07 16:29:28,164 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:28" (1/1) ... [2024-11-07 16:29:28,165 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 16:29:28,166 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 16:29:28,166 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 16:29:28,166 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 16:29:28,166 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:28" (1/1) ... [2024-11-07 16:29:28,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:29:28,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:29:28,191 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 16:29:28,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 16:29:28,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 16:29:28,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 16:29:28,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 16:29:28,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-07 16:29:28,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 16:29:28,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-07 16:29:28,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 16:29:28,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 16:29:28,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 16:29:28,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 16:29:28,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 16:29:28,296 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 16:29:28,297 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 16:29:28,678 INFO L? ?]: Removed 176 outVars from TransFormulas that were not future-live. [2024-11-07 16:29:28,678 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 16:29:28,693 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 16:29:28,693 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-07 16:29:28,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:29:28 BoogieIcfgContainer [2024-11-07 16:29:28,694 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 16:29:28,695 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 16:29:28,695 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 16:29:28,700 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 16:29:28,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:29:27" (1/3) ... [2024-11-07 16:29:28,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@685b4267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:29:28, skipping insertion in model container [2024-11-07 16:29:28,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:28" (2/3) ... [2024-11-07 16:29:28,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@685b4267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:29:28, skipping insertion in model container [2024-11-07 16:29:28,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:29:28" (3/3) ... [2024-11-07 16:29:28,703 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_parent_ptr.i [2024-11-07 16:29:28,714 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 16:29:28,714 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 77 error locations. [2024-11-07 16:29:28,748 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 16:29:28,761 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@b4e5b33, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 16:29:28,762 INFO L334 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2024-11-07 16:29:28,766 INFO L276 IsEmpty]: Start isEmpty. Operand has 155 states, 77 states have (on average 2.1818181818181817) internal successors, (168), 154 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:28,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-07 16:29:28,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:28,771 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-07 16:29:28,772 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-07 16:29:28,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:28,776 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2024-11-07 16:29:28,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:28,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127301356] [2024-11-07 16:29:28,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:28,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:28,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:28,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:28,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127301356] [2024-11-07 16:29:28,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127301356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:28,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:28,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:29:28,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566433004] [2024-11-07 16:29:28,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:28,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:29:28,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:28,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:29:28,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:29:28,973 INFO L87 Difference]: Start difference. First operand has 155 states, 77 states have (on average 2.1818181818181817) internal successors, (168), 154 states have internal predecessors, (168), 0 states have call successors, (0), 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 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:29,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:29,128 INFO L93 Difference]: Finished difference Result 152 states and 162 transitions. [2024-11-07 16:29:29,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:29:29,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2024-11-07 16:29:29,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:29,134 INFO L225 Difference]: With dead ends: 152 [2024-11-07 16:29:29,134 INFO L226 Difference]: Without dead ends: 150 [2024-11-07 16:29:29,135 INFO L431 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 [2024-11-07 16:29:29,137 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 97 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:29,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 136 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:29:29,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-07 16:29:29,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-11-07 16:29:29,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 76 states have (on average 2.1052631578947367) internal successors, (160), 149 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:29,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 160 transitions. [2024-11-07 16:29:29,167 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 160 transitions. Word has length 3 [2024-11-07 16:29:29,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:29,167 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 160 transitions. [2024-11-07 16:29:29,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:29,167 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 160 transitions. [2024-11-07 16:29:29,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-07 16:29:29,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:29,168 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-07 16:29:29,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 16:29:29,169 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-07 16:29:29,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:29,169 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2024-11-07 16:29:29,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:29,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678357672] [2024-11-07 16:29:29,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:29,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:29,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:29,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:29,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:29,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678357672] [2024-11-07 16:29:29,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678357672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:29,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:29,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:29:29,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869994101] [2024-11-07 16:29:29,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:29,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:29:29,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:29,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:29:29,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:29:29,245 INFO L87 Difference]: Start difference. First operand 150 states and 160 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:29,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:29,346 INFO L93 Difference]: Finished difference Result 147 states and 157 transitions. [2024-11-07 16:29:29,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:29:29,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2024-11-07 16:29:29,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:29,349 INFO L225 Difference]: With dead ends: 147 [2024-11-07 16:29:29,349 INFO L226 Difference]: Without dead ends: 147 [2024-11-07 16:29:29,349 INFO L431 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 [2024-11-07 16:29:29,349 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 92 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:29,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 144 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:29:29,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-07 16:29:29,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-11-07 16:29:29,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 76 states have (on average 2.0657894736842106) internal successors, (157), 146 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:29,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 157 transitions. [2024-11-07 16:29:29,360 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 157 transitions. Word has length 3 [2024-11-07 16:29:29,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:29,360 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 157 transitions. [2024-11-07 16:29:29,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:29,360 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 157 transitions. [2024-11-07 16:29:29,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-07 16:29:29,360 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:29,360 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:29,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 16:29:29,361 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-07 16:29:29,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:29,361 INFO L85 PathProgramCache]: Analyzing trace with hash 59265651, now seen corresponding path program 1 times [2024-11-07 16:29:29,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:29,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867579081] [2024-11-07 16:29:29,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:29,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:29,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:29,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:29,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:29,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867579081] [2024-11-07 16:29:29,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867579081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:29,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:29,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:29:29,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127343332] [2024-11-07 16:29:29,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:29,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:29:29,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:29,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:29:29,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:29:29,454 INFO L87 Difference]: Start difference. First operand 147 states and 157 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:29,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:29,625 INFO L93 Difference]: Finished difference Result 152 states and 164 transitions. [2024-11-07 16:29:29,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:29:29,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2024-11-07 16:29:29,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:29,626 INFO L225 Difference]: With dead ends: 152 [2024-11-07 16:29:29,626 INFO L226 Difference]: Without dead ends: 152 [2024-11-07 16:29:29,626 INFO L431 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 [2024-11-07 16:29:29,627 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 175 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:29,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 124 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:29:29,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-07 16:29:29,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 131. [2024-11-07 16:29:29,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 77 states have (on average 1.844155844155844) internal successors, (142), 130 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:29,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 142 transitions. [2024-11-07 16:29:29,632 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 142 transitions. Word has length 8 [2024-11-07 16:29:29,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:29,632 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 142 transitions. [2024-11-07 16:29:29,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:29,632 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 142 transitions. [2024-11-07 16:29:29,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-07 16:29:29,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:29,633 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:29,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 16:29:29,633 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-07 16:29:29,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:29,633 INFO L85 PathProgramCache]: Analyzing trace with hash 59265652, now seen corresponding path program 1 times [2024-11-07 16:29:29,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:29,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971090114] [2024-11-07 16:29:29,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:29,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:29,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:29,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:29,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:29,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971090114] [2024-11-07 16:29:29,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971090114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:29,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:29,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:29:29,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839824257] [2024-11-07 16:29:29,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:29,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:29:29,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:29,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:29:29,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:29:29,751 INFO L87 Difference]: Start difference. First operand 131 states and 142 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:29,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:29,940 INFO L93 Difference]: Finished difference Result 183 states and 201 transitions. [2024-11-07 16:29:29,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:29:29,940 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2024-11-07 16:29:29,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:29,941 INFO L225 Difference]: With dead ends: 183 [2024-11-07 16:29:29,941 INFO L226 Difference]: Without dead ends: 183 [2024-11-07 16:29:29,941 INFO L431 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 [2024-11-07 16:29:29,942 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 184 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:29,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 180 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:29:29,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-07 16:29:29,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 167. [2024-11-07 16:29:29,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 113 states have (on average 1.7168141592920354) internal successors, (194), 166 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) [2024-11-07 16:29:29,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 194 transitions. [2024-11-07 16:29:29,947 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 194 transitions. Word has length 8 [2024-11-07 16:29:29,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:29,947 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 194 transitions. [2024-11-07 16:29:29,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:29,948 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 194 transitions. [2024-11-07 16:29:29,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-07 16:29:29,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:29,948 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:29,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 16:29:29,948 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-07 16:29:29,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:29,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1837237128, now seen corresponding path program 1 times [2024-11-07 16:29:29,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:29,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385530529] [2024-11-07 16:29:29,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:29,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:29,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:30,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:30,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:30,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385530529] [2024-11-07 16:29:30,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385530529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:30,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:30,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:29:30,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550761859] [2024-11-07 16:29:30,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:30,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:29:30,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:30,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:29:30,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:29:30,027 INFO L87 Difference]: Start difference. First operand 167 states and 194 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:30,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:30,103 INFO L93 Difference]: Finished difference Result 167 states and 196 transitions. [2024-11-07 16:29:30,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:29:30,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2024-11-07 16:29:30,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:30,105 INFO L225 Difference]: With dead ends: 167 [2024-11-07 16:29:30,106 INFO L226 Difference]: Without dead ends: 167 [2024-11-07 16:29:30,106 INFO L431 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 [2024-11-07 16:29:30,106 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 3 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:30,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 200 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:29:30,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-07 16:29:30,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2024-11-07 16:29:30,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 115 states have (on average 1.7043478260869565) internal successors, (196), 166 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) [2024-11-07 16:29:30,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 196 transitions. [2024-11-07 16:29:30,117 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 196 transitions. Word has length 9 [2024-11-07 16:29:30,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:30,117 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 196 transitions. [2024-11-07 16:29:30,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:30,117 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 196 transitions. [2024-11-07 16:29:30,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-07 16:29:30,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:30,118 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:30,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 16:29:30,118 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-07 16:29:30,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:30,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1837237129, now seen corresponding path program 1 times [2024-11-07 16:29:30,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:30,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993633719] [2024-11-07 16:29:30,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:30,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:30,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:30,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:30,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:30,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993633719] [2024-11-07 16:29:30,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993633719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:30,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:30,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:29:30,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127669511] [2024-11-07 16:29:30,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:30,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:29:30,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:30,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:29:30,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:29:30,190 INFO L87 Difference]: Start difference. First operand 167 states and 196 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:30,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:30,275 INFO L93 Difference]: Finished difference Result 165 states and 193 transitions. [2024-11-07 16:29:30,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:29:30,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2024-11-07 16:29:30,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:30,276 INFO L225 Difference]: With dead ends: 165 [2024-11-07 16:29:30,276 INFO L226 Difference]: Without dead ends: 165 [2024-11-07 16:29:30,276 INFO L431 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 [2024-11-07 16:29:30,277 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 3 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:30,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 189 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:29:30,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-07 16:29:30,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2024-11-07 16:29:30,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 115 states have (on average 1.6782608695652175) internal successors, (193), 164 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) [2024-11-07 16:29:30,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 193 transitions. [2024-11-07 16:29:30,284 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 193 transitions. Word has length 9 [2024-11-07 16:29:30,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:30,284 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 193 transitions. [2024-11-07 16:29:30,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:30,284 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 193 transitions. [2024-11-07 16:29:30,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-07 16:29:30,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:30,285 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:30,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 16:29:30,285 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-07 16:29:30,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:30,285 INFO L85 PathProgramCache]: Analyzing trace with hash 243138738, now seen corresponding path program 1 times [2024-11-07 16:29:30,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:30,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245265610] [2024-11-07 16:29:30,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:30,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:30,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:30,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:30,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:30,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245265610] [2024-11-07 16:29:30,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245265610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:30,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:30,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:29:30,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550877521] [2024-11-07 16:29:30,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:30,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:29:30,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:30,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:29:30,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:29:30,325 INFO L87 Difference]: Start difference. First operand 165 states and 193 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:30,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:30,339 INFO L93 Difference]: Finished difference Result 165 states and 192 transitions. [2024-11-07 16:29:30,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:29:30,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-07 16:29:30,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:30,344 INFO L225 Difference]: With dead ends: 165 [2024-11-07 16:29:30,344 INFO L226 Difference]: Without dead ends: 165 [2024-11-07 16:29:30,344 INFO L431 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 [2024-11-07 16:29:30,344 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 1 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:30,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 254 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:29:30,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-07 16:29:30,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2024-11-07 16:29:30,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 115 states have (on average 1.6695652173913043) internal successors, (192), 164 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:30,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 192 transitions. [2024-11-07 16:29:30,352 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 192 transitions. Word has length 13 [2024-11-07 16:29:30,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:30,352 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 192 transitions. [2024-11-07 16:29:30,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:30,352 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 192 transitions. [2024-11-07 16:29:30,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-07 16:29:30,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:30,352 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:30,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 16:29:30,353 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-07 16:29:30,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:30,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1052634445, now seen corresponding path program 1 times [2024-11-07 16:29:30,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:30,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037112686] [2024-11-07 16:29:30,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:30,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:30,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:30,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:30,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:30,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037112686] [2024-11-07 16:29:30,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037112686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:30,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:30,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:29:30,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868511741] [2024-11-07 16:29:30,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:30,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:29:30,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:30,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:29:30,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:29:30,445 INFO L87 Difference]: Start difference. First operand 165 states and 192 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:30,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:30,582 INFO L93 Difference]: Finished difference Result 172 states and 201 transitions. [2024-11-07 16:29:30,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:29:30,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2024-11-07 16:29:30,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:30,583 INFO L225 Difference]: With dead ends: 172 [2024-11-07 16:29:30,583 INFO L226 Difference]: Without dead ends: 172 [2024-11-07 16:29:30,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:29:30,583 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 21 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:30,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 315 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:29:30,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-07 16:29:30,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 162. [2024-11-07 16:29:30,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 117 states have (on average 1.623931623931624) internal successors, (190), 161 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:30,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 190 transitions. [2024-11-07 16:29:30,587 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 190 transitions. Word has length 14 [2024-11-07 16:29:30,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:30,587 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 190 transitions. [2024-11-07 16:29:30,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:30,587 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 190 transitions. [2024-11-07 16:29:30,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-07 16:29:30,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:30,588 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:30,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 16:29:30,588 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-07 16:29:30,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:30,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1052634444, now seen corresponding path program 1 times [2024-11-07 16:29:30,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:30,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092331856] [2024-11-07 16:29:30,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:30,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:30,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:30,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:30,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:30,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092331856] [2024-11-07 16:29:30,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092331856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:30,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:30,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:29:30,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332538699] [2024-11-07 16:29:30,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:30,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:29:30,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:30,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:29:30,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:29:30,731 INFO L87 Difference]: Start difference. First operand 162 states and 190 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:30,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:30,879 INFO L93 Difference]: Finished difference Result 174 states and 204 transitions. [2024-11-07 16:29:30,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 16:29:30,879 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2024-11-07 16:29:30,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:30,880 INFO L225 Difference]: With dead ends: 174 [2024-11-07 16:29:30,880 INFO L226 Difference]: Without dead ends: 174 [2024-11-07 16:29:30,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:29:30,880 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 21 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:30,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 331 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:29:30,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-07 16:29:30,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 169. [2024-11-07 16:29:30,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 128 states have (on average 1.5859375) internal successors, (203), 168 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:30,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 203 transitions. [2024-11-07 16:29:30,883 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 203 transitions. Word has length 14 [2024-11-07 16:29:30,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:30,883 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 203 transitions. [2024-11-07 16:29:30,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:30,884 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 203 transitions. [2024-11-07 16:29:30,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-07 16:29:30,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:30,884 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:30,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 16:29:30,884 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-07 16:29:30,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:30,885 INFO L85 PathProgramCache]: Analyzing trace with hash 395262676, now seen corresponding path program 1 times [2024-11-07 16:29:30,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:30,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140324892] [2024-11-07 16:29:30,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:30,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:30,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:30,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:30,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:30,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140324892] [2024-11-07 16:29:30,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140324892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:30,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:30,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:29:30,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475565136] [2024-11-07 16:29:30,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:30,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:29:30,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:30,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:29:30,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:29:30,904 INFO L87 Difference]: Start difference. First operand 169 states and 203 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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) [2024-11-07 16:29:30,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:30,910 INFO L93 Difference]: Finished difference Result 171 states and 205 transitions. [2024-11-07 16:29:30,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:29:30,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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 [2024-11-07 16:29:30,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:30,911 INFO L225 Difference]: With dead ends: 171 [2024-11-07 16:29:30,911 INFO L226 Difference]: Without dead ends: 171 [2024-11-07 16:29:30,911 INFO L431 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 [2024-11-07 16:29:30,912 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:30,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 246 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:29:30,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-07 16:29:30,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2024-11-07 16:29:30,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 130 states have (on average 1.5769230769230769) internal successors, (205), 170 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:30,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 205 transitions. [2024-11-07 16:29:30,914 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 205 transitions. Word has length 15 [2024-11-07 16:29:30,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:30,914 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 205 transitions. [2024-11-07 16:29:30,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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) [2024-11-07 16:29:30,915 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 205 transitions. [2024-11-07 16:29:30,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-07 16:29:30,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:30,915 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:30,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 16:29:30,915 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-07 16:29:30,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:30,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1476383815, now seen corresponding path program 1 times [2024-11-07 16:29:30,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:30,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954044679] [2024-11-07 16:29:30,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:30,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:30,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:30,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:30,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:30,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954044679] [2024-11-07 16:29:30,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954044679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:30,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:30,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:29:30,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165283149] [2024-11-07 16:29:30,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:30,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:29:30,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:30,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:29:30,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:29:30,992 INFO L87 Difference]: Start difference. First operand 171 states and 205 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:31,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:31,061 INFO L93 Difference]: Finished difference Result 177 states and 207 transitions. [2024-11-07 16:29:31,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:29:31,062 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2024-11-07 16:29:31,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:31,062 INFO L225 Difference]: With dead ends: 177 [2024-11-07 16:29:31,062 INFO L226 Difference]: Without dead ends: 177 [2024-11-07 16:29:31,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:29:31,063 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 19 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:31,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 331 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:29:31,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-07 16:29:31,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 172. [2024-11-07 16:29:31,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 131 states have (on average 1.5725190839694656) internal successors, (206), 171 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) [2024-11-07 16:29:31,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 206 transitions. [2024-11-07 16:29:31,067 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 206 transitions. Word has length 17 [2024-11-07 16:29:31,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:31,067 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 206 transitions. [2024-11-07 16:29:31,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:31,067 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 206 transitions. [2024-11-07 16:29:31,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-07 16:29:31,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:31,068 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:31,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 16:29:31,068 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-07 16:29:31,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:31,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1645245929, now seen corresponding path program 1 times [2024-11-07 16:29:31,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:31,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009293157] [2024-11-07 16:29:31,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:31,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:31,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:31,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:31,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:31,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009293157] [2024-11-07 16:29:31,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009293157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:31,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:31,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 16:29:31,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149590598] [2024-11-07 16:29:31,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:31,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:29:31,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:31,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:29:31,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:29:31,263 INFO L87 Difference]: Start difference. First operand 172 states and 206 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:31,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:31,509 INFO L93 Difference]: Finished difference Result 211 states and 251 transitions. [2024-11-07 16:29:31,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:29:31,509 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2024-11-07 16:29:31,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:31,510 INFO L225 Difference]: With dead ends: 211 [2024-11-07 16:29:31,510 INFO L226 Difference]: Without dead ends: 211 [2024-11-07 16:29:31,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:29:31,511 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 51 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:31,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 477 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:29:31,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-07 16:29:31,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 186. [2024-11-07 16:29:31,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 145 states have (on average 1.5517241379310345) internal successors, (225), 185 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:31,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 225 transitions. [2024-11-07 16:29:31,516 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 225 transitions. Word has length 17 [2024-11-07 16:29:31,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:31,516 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 225 transitions. [2024-11-07 16:29:31,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:31,516 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 225 transitions. [2024-11-07 16:29:31,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-07 16:29:31,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:31,517 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:31,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 16:29:31,517 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-07 16:29:31,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:31,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1465631940, now seen corresponding path program 1 times [2024-11-07 16:29:31,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:31,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588078529] [2024-11-07 16:29:31,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:31,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:31,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:32,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:32,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:32,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588078529] [2024-11-07 16:29:32,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588078529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:32,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:32,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 16:29:32,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568930308] [2024-11-07 16:29:32,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:32,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 16:29:32,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:32,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 16:29:32,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-07 16:29:32,040 INFO L87 Difference]: Start difference. First operand 186 states and 225 transitions. Second operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 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) [2024-11-07 16:29:32,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:32,683 INFO L93 Difference]: Finished difference Result 203 states and 245 transitions. [2024-11-07 16:29:32,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 16:29:32,683 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 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 [2024-11-07 16:29:32,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:32,684 INFO L225 Difference]: With dead ends: 203 [2024-11-07 16:29:32,684 INFO L226 Difference]: Without dead ends: 203 [2024-11-07 16:29:32,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2024-11-07 16:29:32,685 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 159 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:32,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 315 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 16:29:32,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-07 16:29:32,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 191. [2024-11-07 16:29:32,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 150 states have (on average 1.54) internal successors, (231), 190 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:32,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 231 transitions. [2024-11-07 16:29:32,687 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 231 transitions. Word has length 19 [2024-11-07 16:29:32,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:32,688 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 231 transitions. [2024-11-07 16:29:32,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 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) [2024-11-07 16:29:32,688 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 231 transitions. [2024-11-07 16:29:32,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-07 16:29:32,688 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:32,688 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:32,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 16:29:32,688 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-07 16:29:32,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:32,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1465631939, now seen corresponding path program 1 times [2024-11-07 16:29:32,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:32,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62289287] [2024-11-07 16:29:32,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:32,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:32,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:33,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:33,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:33,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62289287] [2024-11-07 16:29:33,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62289287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:33,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:33,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 16:29:33,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223824572] [2024-11-07 16:29:33,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:33,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 16:29:33,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:33,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 16:29:33,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-07 16:29:33,008 INFO L87 Difference]: Start difference. First operand 191 states and 231 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 11 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) [2024-11-07 16:29:33,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:33,375 INFO L93 Difference]: Finished difference Result 213 states and 246 transitions. [2024-11-07 16:29:33,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 16:29:33,376 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 11 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 [2024-11-07 16:29:33,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:33,376 INFO L225 Difference]: With dead ends: 213 [2024-11-07 16:29:33,376 INFO L226 Difference]: Without dead ends: 213 [2024-11-07 16:29:33,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2024-11-07 16:29:33,377 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 320 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:33,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 355 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 16:29:33,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-07 16:29:33,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 195. [2024-11-07 16:29:33,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 154 states have (on average 1.5324675324675325) internal successors, (236), 194 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:33,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 236 transitions. [2024-11-07 16:29:33,382 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 236 transitions. Word has length 19 [2024-11-07 16:29:33,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:33,383 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 236 transitions. [2024-11-07 16:29:33,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 11 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) [2024-11-07 16:29:33,383 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 236 transitions. [2024-11-07 16:29:33,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-07 16:29:33,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:33,383 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:33,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 16:29:33,383 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-07 16:29:33,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:33,384 INFO L85 PathProgramCache]: Analyzing trace with hash -825042817, now seen corresponding path program 1 times [2024-11-07 16:29:33,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:33,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086801437] [2024-11-07 16:29:33,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:33,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:33,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:33,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:33,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086801437] [2024-11-07 16:29:33,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086801437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:33,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:33,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:29:33,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682095082] [2024-11-07 16:29:33,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:33,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:29:33,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:33,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:29:33,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:29:33,454 INFO L87 Difference]: Start difference. First operand 195 states and 236 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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) [2024-11-07 16:29:33,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:33,570 INFO L93 Difference]: Finished difference Result 194 states and 234 transitions. [2024-11-07 16:29:33,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:29:33,571 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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 [2024-11-07 16:29:33,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:33,571 INFO L225 Difference]: With dead ends: 194 [2024-11-07 16:29:33,571 INFO L226 Difference]: Without dead ends: 194 [2024-11-07 16:29:33,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:29:33,572 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 3 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:33,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 302 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:29:33,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-07 16:29:33,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2024-11-07 16:29:33,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 154 states have (on average 1.5194805194805194) internal successors, (234), 193 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:33,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 234 transitions. [2024-11-07 16:29:33,578 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 234 transitions. Word has length 19 [2024-11-07 16:29:33,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:33,578 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 234 transitions. [2024-11-07 16:29:33,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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) [2024-11-07 16:29:33,579 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 234 transitions. [2024-11-07 16:29:33,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-07 16:29:33,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:33,580 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:33,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 16:29:33,580 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-07 16:29:33,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:33,580 INFO L85 PathProgramCache]: Analyzing trace with hash -825042816, now seen corresponding path program 1 times [2024-11-07 16:29:33,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:33,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924190797] [2024-11-07 16:29:33,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:33,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:33,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:33,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:33,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:33,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924190797] [2024-11-07 16:29:33,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924190797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:33,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:33,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:29:33,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177457213] [2024-11-07 16:29:33,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:33,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:29:33,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:33,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:29:33,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:29:33,711 INFO L87 Difference]: Start difference. First operand 194 states and 234 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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) [2024-11-07 16:29:33,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:33,841 INFO L93 Difference]: Finished difference Result 193 states and 232 transitions. [2024-11-07 16:29:33,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:29:33,842 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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 [2024-11-07 16:29:33,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:33,842 INFO L225 Difference]: With dead ends: 193 [2024-11-07 16:29:33,843 INFO L226 Difference]: Without dead ends: 193 [2024-11-07 16:29:33,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:29:33,843 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 2 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:33,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 280 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:29:33,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-07 16:29:33,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2024-11-07 16:29:33,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 154 states have (on average 1.5064935064935066) internal successors, (232), 192 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:33,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 232 transitions. [2024-11-07 16:29:33,851 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 232 transitions. Word has length 19 [2024-11-07 16:29:33,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:33,851 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 232 transitions. [2024-11-07 16:29:33,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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) [2024-11-07 16:29:33,851 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 232 transitions. [2024-11-07 16:29:33,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-07 16:29:33,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:33,852 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:33,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 16:29:33,852 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-07 16:29:33,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:33,852 INFO L85 PathProgramCache]: Analyzing trace with hash -3442432, now seen corresponding path program 1 times [2024-11-07 16:29:33,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:33,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526346717] [2024-11-07 16:29:33,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:33,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:33,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:33,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:33,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:33,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526346717] [2024-11-07 16:29:33,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526346717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:33,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:33,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:29:33,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51698059] [2024-11-07 16:29:33,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:33,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:29:33,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:33,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:29:33,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:29:33,928 INFO L87 Difference]: Start difference. First operand 193 states and 232 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:34,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:34,034 INFO L93 Difference]: Finished difference Result 198 states and 239 transitions. [2024-11-07 16:29:34,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:29:34,035 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-07 16:29:34,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:34,035 INFO L225 Difference]: With dead ends: 198 [2024-11-07 16:29:34,036 INFO L226 Difference]: Without dead ends: 198 [2024-11-07 16:29:34,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:29:34,036 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 68 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:34,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 99 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:29:34,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-07 16:29:34,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 185. [2024-11-07 16:29:34,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 153 states have (on average 1.4640522875816993) internal successors, (224), 184 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:34,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 224 transitions. [2024-11-07 16:29:34,040 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 224 transitions. Word has length 22 [2024-11-07 16:29:34,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:34,040 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 224 transitions. [2024-11-07 16:29:34,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:34,040 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 224 transitions. [2024-11-07 16:29:34,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-07 16:29:34,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:34,041 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:34,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 16:29:34,042 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-07 16:29:34,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:34,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1247328411, now seen corresponding path program 1 times [2024-11-07 16:29:34,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:34,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28445580] [2024-11-07 16:29:34,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:34,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:34,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:34,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:34,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:34,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28445580] [2024-11-07 16:29:34,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28445580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:34,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:34,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 16:29:34,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570622462] [2024-11-07 16:29:34,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:34,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 16:29:34,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:34,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 16:29:34,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:29:34,193 INFO L87 Difference]: Start difference. First operand 185 states and 224 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:34,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:34,407 INFO L93 Difference]: Finished difference Result 196 states and 236 transitions. [2024-11-07 16:29:34,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 16:29:34,408 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-07 16:29:34,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:34,409 INFO L225 Difference]: With dead ends: 196 [2024-11-07 16:29:34,409 INFO L226 Difference]: Without dead ends: 196 [2024-11-07 16:29:34,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-11-07 16:29:34,409 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 138 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:34,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 251 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:29:34,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-07 16:29:34,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 184. [2024-11-07 16:29:34,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 153 states have (on average 1.4509803921568627) internal successors, (222), 183 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:34,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 222 transitions. [2024-11-07 16:29:34,413 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 222 transitions. Word has length 22 [2024-11-07 16:29:34,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:34,414 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 222 transitions. [2024-11-07 16:29:34,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:34,415 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 222 transitions. [2024-11-07 16:29:34,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-07 16:29:34,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:34,415 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:34,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 16:29:34,416 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-07 16:29:34,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:34,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1247328412, now seen corresponding path program 1 times [2024-11-07 16:29:34,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:34,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295412480] [2024-11-07 16:29:34,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:34,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:34,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:34,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:34,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:34,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295412480] [2024-11-07 16:29:34,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295412480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:34,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:34,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 16:29:34,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982049880] [2024-11-07 16:29:34,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:34,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 16:29:34,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:34,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 16:29:34,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:29:34,626 INFO L87 Difference]: Start difference. First operand 184 states and 222 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:34,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:34,908 INFO L93 Difference]: Finished difference Result 195 states and 234 transitions. [2024-11-07 16:29:34,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 16:29:34,909 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-07 16:29:34,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:34,909 INFO L225 Difference]: With dead ends: 195 [2024-11-07 16:29:34,909 INFO L226 Difference]: Without dead ends: 195 [2024-11-07 16:29:34,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-11-07 16:29:34,910 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 133 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:34,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 288 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:29:34,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-07 16:29:34,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 183. [2024-11-07 16:29:34,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 153 states have (on average 1.4379084967320261) internal successors, (220), 182 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:34,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 220 transitions. [2024-11-07 16:29:34,913 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 220 transitions. Word has length 22 [2024-11-07 16:29:34,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:34,913 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 220 transitions. [2024-11-07 16:29:34,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:34,913 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 220 transitions. [2024-11-07 16:29:34,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-07 16:29:34,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:34,914 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:34,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 16:29:34,914 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-07 16:29:34,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:34,914 INFO L85 PathProgramCache]: Analyzing trace with hash -19499741, now seen corresponding path program 1 times [2024-11-07 16:29:34,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:34,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133462360] [2024-11-07 16:29:34,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:34,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:34,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:34,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:34,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:34,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133462360] [2024-11-07 16:29:34,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133462360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:34,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:34,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:29:34,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158170829] [2024-11-07 16:29:34,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:34,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:29:34,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:34,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:29:34,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:29:34,968 INFO L87 Difference]: Start difference. First operand 183 states and 220 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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) [2024-11-07 16:29:35,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:35,076 INFO L93 Difference]: Finished difference Result 182 states and 218 transitions. [2024-11-07 16:29:35,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:29:35,076 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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 [2024-11-07 16:29:35,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:35,077 INFO L225 Difference]: With dead ends: 182 [2024-11-07 16:29:35,077 INFO L226 Difference]: Without dead ends: 182 [2024-11-07 16:29:35,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:29:35,077 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 3 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:35,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 271 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:29:35,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-07 16:29:35,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2024-11-07 16:29:35,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 153 states have (on average 1.4248366013071896) internal successors, (218), 181 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:35,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 218 transitions. [2024-11-07 16:29:35,080 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 218 transitions. Word has length 23 [2024-11-07 16:29:35,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:35,080 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 218 transitions. [2024-11-07 16:29:35,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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) [2024-11-07 16:29:35,081 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 218 transitions. [2024-11-07 16:29:35,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-07 16:29:35,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:35,081 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:35,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 16:29:35,081 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-07 16:29:35,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:35,082 INFO L85 PathProgramCache]: Analyzing trace with hash -19499740, now seen corresponding path program 1 times [2024-11-07 16:29:35,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:35,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102080668] [2024-11-07 16:29:35,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:35,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:35,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:35,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:35,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:35,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102080668] [2024-11-07 16:29:35,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102080668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:35,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:35,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:29:35,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750561180] [2024-11-07 16:29:35,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:35,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:29:35,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:35,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:29:35,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:29:35,186 INFO L87 Difference]: Start difference. First operand 182 states and 218 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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) [2024-11-07 16:29:35,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:35,304 INFO L93 Difference]: Finished difference Result 181 states and 216 transitions. [2024-11-07 16:29:35,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:29:35,305 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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 [2024-11-07 16:29:35,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:35,305 INFO L225 Difference]: With dead ends: 181 [2024-11-07 16:29:35,305 INFO L226 Difference]: Without dead ends: 181 [2024-11-07 16:29:35,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:29:35,305 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 2 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:35,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 263 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:29:35,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-07 16:29:35,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2024-11-07 16:29:35,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 153 states have (on average 1.411764705882353) internal successors, (216), 180 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:35,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 216 transitions. [2024-11-07 16:29:35,308 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 216 transitions. Word has length 23 [2024-11-07 16:29:35,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:35,309 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 216 transitions. [2024-11-07 16:29:35,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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) [2024-11-07 16:29:35,309 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 216 transitions. [2024-11-07 16:29:35,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-07 16:29:35,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:35,309 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:35,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 16:29:35,309 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-07 16:29:35,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:35,310 INFO L85 PathProgramCache]: Analyzing trace with hash 998290617, now seen corresponding path program 1 times [2024-11-07 16:29:35,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:35,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758286135] [2024-11-07 16:29:35,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:35,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:35,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:35,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:35,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:35,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758286135] [2024-11-07 16:29:35,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758286135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:35,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:35,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 16:29:35,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131136116] [2024-11-07 16:29:35,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:35,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 16:29:35,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:35,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 16:29:35,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-07 16:29:35,457 INFO L87 Difference]: Start difference. First operand 181 states and 216 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 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) [2024-11-07 16:29:35,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:35,779 INFO L93 Difference]: Finished difference Result 215 states and 251 transitions. [2024-11-07 16:29:35,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 16:29:35,779 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 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 [2024-11-07 16:29:35,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:35,780 INFO L225 Difference]: With dead ends: 215 [2024-11-07 16:29:35,780 INFO L226 Difference]: Without dead ends: 215 [2024-11-07 16:29:35,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2024-11-07 16:29:35,781 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 184 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:35,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 435 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:29:35,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-07 16:29:35,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 194. [2024-11-07 16:29:35,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 166 states have (on average 1.4036144578313252) internal successors, (233), 193 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:35,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 233 transitions. [2024-11-07 16:29:35,784 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 233 transitions. Word has length 24 [2024-11-07 16:29:35,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:35,784 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 233 transitions. [2024-11-07 16:29:35,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 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) [2024-11-07 16:29:35,784 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 233 transitions. [2024-11-07 16:29:35,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-07 16:29:35,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:35,785 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:35,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 16:29:35,785 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-07 16:29:35,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:35,785 INFO L85 PathProgramCache]: Analyzing trace with hash 998278641, now seen corresponding path program 1 times [2024-11-07 16:29:35,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:35,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781629694] [2024-11-07 16:29:35,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:35,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:35,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:35,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:35,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:35,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781629694] [2024-11-07 16:29:35,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781629694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:35,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:35,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:29:35,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746387593] [2024-11-07 16:29:35,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:35,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:29:35,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:35,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:29:35,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:29:35,848 INFO L87 Difference]: Start difference. First operand 194 states and 233 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) [2024-11-07 16:29:35,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:35,977 INFO L93 Difference]: Finished difference Result 234 states and 280 transitions. [2024-11-07 16:29:35,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:29:35,977 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 [2024-11-07 16:29:35,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:35,978 INFO L225 Difference]: With dead ends: 234 [2024-11-07 16:29:35,978 INFO L226 Difference]: Without dead ends: 234 [2024-11-07 16:29:35,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:29:35,979 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 79 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:35,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 150 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:29:35,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-07 16:29:35,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 172. [2024-11-07 16:29:35,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 150 states have (on average 1.36) internal successors, (204), 171 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:35,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 204 transitions. [2024-11-07 16:29:35,982 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 204 transitions. Word has length 24 [2024-11-07 16:29:35,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:35,982 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 204 transitions. [2024-11-07 16:29:35,982 INFO L472 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) [2024-11-07 16:29:35,982 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 204 transitions. [2024-11-07 16:29:35,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-07 16:29:35,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:35,982 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:35,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-07 16:29:35,982 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-07 16:29:35,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:35,982 INFO L85 PathProgramCache]: Analyzing trace with hash 525851589, now seen corresponding path program 1 times [2024-11-07 16:29:35,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:35,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480222296] [2024-11-07 16:29:35,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:35,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:35,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:36,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:36,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:36,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480222296] [2024-11-07 16:29:36,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480222296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:36,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:36,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 16:29:36,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118937848] [2024-11-07 16:29:36,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:36,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 16:29:36,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:36,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 16:29:36,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-07 16:29:36,407 INFO L87 Difference]: Start difference. First operand 172 states and 204 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:36,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:36,932 INFO L93 Difference]: Finished difference Result 224 states and 262 transitions. [2024-11-07 16:29:36,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 16:29:36,932 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-07 16:29:36,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:36,933 INFO L225 Difference]: With dead ends: 224 [2024-11-07 16:29:36,933 INFO L226 Difference]: Without dead ends: 224 [2024-11-07 16:29:36,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2024-11-07 16:29:36,934 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 243 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:36,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 329 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 16:29:36,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-07 16:29:36,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 172. [2024-11-07 16:29:36,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 150 states have (on average 1.3466666666666667) internal successors, (202), 171 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:36,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 202 transitions. [2024-11-07 16:29:36,938 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 202 transitions. Word has length 25 [2024-11-07 16:29:36,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:36,938 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 202 transitions. [2024-11-07 16:29:36,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:36,938 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 202 transitions. [2024-11-07 16:29:36,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-07 16:29:36,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:36,938 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:36,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-07 16:29:36,939 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-07 16:29:36,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:36,939 INFO L85 PathProgramCache]: Analyzing trace with hash -896291290, now seen corresponding path program 1 times [2024-11-07 16:29:36,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:36,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420446839] [2024-11-07 16:29:36,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:36,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:36,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:37,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:37,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:37,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420446839] [2024-11-07 16:29:37,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420446839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:37,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:37,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 16:29:37,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344131568] [2024-11-07 16:29:37,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:37,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 16:29:37,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:37,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 16:29:37,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-07 16:29:37,109 INFO L87 Difference]: Start difference. First operand 172 states and 202 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:37,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:37,400 INFO L93 Difference]: Finished difference Result 196 states and 231 transitions. [2024-11-07 16:29:37,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 16:29:37,400 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-07 16:29:37,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:37,401 INFO L225 Difference]: With dead ends: 196 [2024-11-07 16:29:37,401 INFO L226 Difference]: Without dead ends: 196 [2024-11-07 16:29:37,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2024-11-07 16:29:37,402 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 133 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:37,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 365 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:29:37,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-07 16:29:37,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 171. [2024-11-07 16:29:37,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 150 states have (on average 1.3333333333333333) internal successors, (200), 170 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:37,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 200 transitions. [2024-11-07 16:29:37,408 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 200 transitions. Word has length 25 [2024-11-07 16:29:37,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:37,408 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 200 transitions. [2024-11-07 16:29:37,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:37,409 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 200 transitions. [2024-11-07 16:29:37,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-07 16:29:37,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:37,409 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:37,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-07 16:29:37,409 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-07 16:29:37,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:37,409 INFO L85 PathProgramCache]: Analyzing trace with hash -896291289, now seen corresponding path program 1 times [2024-11-07 16:29:37,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:37,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154515853] [2024-11-07 16:29:37,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:37,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:37,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:37,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:37,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:37,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154515853] [2024-11-07 16:29:37,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154515853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:37,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:37,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 16:29:37,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638309636] [2024-11-07 16:29:37,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:37,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 16:29:37,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:37,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 16:29:37,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-07 16:29:37,700 INFO L87 Difference]: Start difference. First operand 171 states and 200 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:38,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:38,007 INFO L93 Difference]: Finished difference Result 182 states and 212 transitions. [2024-11-07 16:29:38,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 16:29:38,008 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-07 16:29:38,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:38,008 INFO L225 Difference]: With dead ends: 182 [2024-11-07 16:29:38,008 INFO L226 Difference]: Without dead ends: 182 [2024-11-07 16:29:38,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2024-11-07 16:29:38,009 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 121 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:38,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 287 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:29:38,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-07 16:29:38,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 170. [2024-11-07 16:29:38,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 150 states have (on average 1.32) internal successors, (198), 169 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:38,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 198 transitions. [2024-11-07 16:29:38,011 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 198 transitions. Word has length 25 [2024-11-07 16:29:38,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:38,012 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 198 transitions. [2024-11-07 16:29:38,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:38,012 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 198 transitions. [2024-11-07 16:29:38,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-07 16:29:38,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:38,012 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:38,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-07 16:29:38,012 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-07 16:29:38,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:38,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1096103808, now seen corresponding path program 1 times [2024-11-07 16:29:38,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:38,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584535399] [2024-11-07 16:29:38,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:38,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:38,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:38,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:38,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:38,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584535399] [2024-11-07 16:29:38,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584535399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:38,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:38,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 16:29:38,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425675208] [2024-11-07 16:29:38,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:38,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 16:29:38,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:38,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 16:29:38,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:29:38,184 INFO L87 Difference]: Start difference. First operand 170 states and 198 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:38,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:38,400 INFO L93 Difference]: Finished difference Result 181 states and 211 transitions. [2024-11-07 16:29:38,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 16:29:38,401 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-07 16:29:38,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:38,402 INFO L225 Difference]: With dead ends: 181 [2024-11-07 16:29:38,402 INFO L226 Difference]: Without dead ends: 181 [2024-11-07 16:29:38,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-11-07 16:29:38,402 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 117 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:38,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 239 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:29:38,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-07 16:29:38,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 169. [2024-11-07 16:29:38,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 150 states have (on average 1.3133333333333332) internal successors, (197), 168 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) [2024-11-07 16:29:38,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 197 transitions. [2024-11-07 16:29:38,414 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 197 transitions. Word has length 26 [2024-11-07 16:29:38,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:38,414 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 197 transitions. [2024-11-07 16:29:38,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:38,414 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 197 transitions. [2024-11-07 16:29:38,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-07 16:29:38,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:38,414 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:38,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-07 16:29:38,415 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-07 16:29:38,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:38,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1096103807, now seen corresponding path program 1 times [2024-11-07 16:29:38,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:38,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116580340] [2024-11-07 16:29:38,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:38,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:38,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:38,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:38,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:38,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116580340] [2024-11-07 16:29:38,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116580340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:38,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:38,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 16:29:38,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407270586] [2024-11-07 16:29:38,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:38,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 16:29:38,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:38,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 16:29:38,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:29:38,622 INFO L87 Difference]: Start difference. First operand 169 states and 197 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:38,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:38,914 INFO L93 Difference]: Finished difference Result 180 states and 210 transitions. [2024-11-07 16:29:38,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 16:29:38,914 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-07 16:29:38,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:38,915 INFO L225 Difference]: With dead ends: 180 [2024-11-07 16:29:38,915 INFO L226 Difference]: Without dead ends: 180 [2024-11-07 16:29:38,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-11-07 16:29:38,915 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 113 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:38,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 241 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:29:38,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-07 16:29:38,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 168. [2024-11-07 16:29:38,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 150 states have (on average 1.3066666666666666) internal successors, (196), 167 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) [2024-11-07 16:29:38,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 196 transitions. [2024-11-07 16:29:38,918 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 196 transitions. Word has length 26 [2024-11-07 16:29:38,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:38,918 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 196 transitions. [2024-11-07 16:29:38,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:38,918 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 196 transitions. [2024-11-07 16:29:38,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-07 16:29:38,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:38,921 INFO L215 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] [2024-11-07 16:29:38,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-07 16:29:38,922 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-07 16:29:38,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:38,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1722459940, now seen corresponding path program 1 times [2024-11-07 16:29:38,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:38,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731645666] [2024-11-07 16:29:38,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:38,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:38,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:39,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:39,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:39,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731645666] [2024-11-07 16:29:39,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731645666] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:29:39,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310583740] [2024-11-07 16:29:39,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:39,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:29:39,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:29:39,038 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:29:39,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 16:29:39,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:39,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-07 16:29:39,146 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:29:39,172 INFO L378 Elim1Store]: Elim1 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 [2024-11-07 16:29:39,181 INFO L378 Elim1Store]: Elim1 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 [2024-11-07 16:29:39,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-07 16:29:39,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-07 16:29:39,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:39,253 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:29:39,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:39,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310583740] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:29:39,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:29:39,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2024-11-07 16:29:39,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091064930] [2024-11-07 16:29:39,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:29:39,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:29:39,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:39,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:29:39,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:29:39,302 INFO L87 Difference]: Start difference. First operand 168 states and 196 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:39,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:39,372 INFO L93 Difference]: Finished difference Result 171 states and 199 transitions. [2024-11-07 16:29:39,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:29:39,372 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-07 16:29:39,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:39,372 INFO L225 Difference]: With dead ends: 171 [2024-11-07 16:29:39,373 INFO L226 Difference]: Without dead ends: 171 [2024-11-07 16:29:39,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:29:39,374 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 2 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:39,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 343 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:29:39,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-07 16:29:39,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2024-11-07 16:29:39,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 152 states have (on average 1.3026315789473684) internal successors, (198), 169 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:39,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 198 transitions. [2024-11-07 16:29:39,379 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 198 transitions. Word has length 27 [2024-11-07 16:29:39,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:39,379 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 198 transitions. [2024-11-07 16:29:39,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:39,380 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 198 transitions. [2024-11-07 16:29:39,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-07 16:29:39,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:39,380 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:39,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 16:29:39,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-07 16:29:39,585 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-07 16:29:39,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:39,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1856650752, now seen corresponding path program 1 times [2024-11-07 16:29:39,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:39,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020350611] [2024-11-07 16:29:39,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:39,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:39,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:39,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:39,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:39,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020350611] [2024-11-07 16:29:39,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020350611] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:29:39,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515808934] [2024-11-07 16:29:39,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:39,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:29:39,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:29:39,795 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:29:39,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 16:29:39,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:39,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-07 16:29:39,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:29:39,959 INFO L378 Elim1Store]: Elim1 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 15 treesize of output 1 [2024-11-07 16:29:40,022 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:29:40,022 INFO L378 Elim1Store]: Elim1 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 46 treesize of output 36 [2024-11-07 16:29:40,387 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~n~0#1.base_87| Int) (|v_ULTIMATE.start_main_~st~0#1.base_30| Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~n~0#1.base_87|) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~n~0#1.base_87| 1) |v_ULTIMATE.start_main_~st~0#1.base_30|) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~st~0#1.base_30| 0) |v_ULTIMATE.start_main_~n~0#1.base_87| 0)))) is different from true [2024-11-07 16:29:40,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-07 16:29:40,402 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:29:40,520 INFO L378 Elim1Store]: Elim1 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 22 treesize of output 20 [2024-11-07 16:29:40,522 INFO L378 Elim1Store]: Elim1 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 38 treesize of output 36 [2024-11-07 16:29:44,554 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0))) (let ((.cse1 (= |c_ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse2 (store .cse0 |c_ULTIMATE.start_main_~root~0#1.base| 0))) (and (or (forall ((v_arrayElimCell_6 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store .cse0 v_arrayElimCell_6 0) v_antiDerIndex_entry0_1))) .cse1) (or (forall ((v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select .cse2 v_antiDerIndex_entry0_1))) (not .cse1)) (forall ((v_arrayElimCell_6 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse3 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse3 (select .cse2 v_antiDerIndex_entry0_1)) (= .cse3 (select (store .cse0 v_arrayElimCell_6 0) v_antiDerIndex_entry0_1)))))))) is different from false [2024-11-07 16:29:44,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:44,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515808934] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:29:44,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:29:44,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2024-11-07 16:29:44,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238670681] [2024-11-07 16:29:44,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:29:44,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-07 16:29:44,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:44,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-07 16:29:44,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=537, Unknown=2, NotChecked=94, Total=702 [2024-11-07 16:29:44,753 INFO L87 Difference]: Start difference. First operand 170 states and 198 transitions. Second operand has 27 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 27 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:45,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:45,722 INFO L93 Difference]: Finished difference Result 202 states and 232 transitions. [2024-11-07 16:29:45,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 16:29:45,723 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 27 states have internal predecessors, (70), 0 states have call successors, (0), 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 [2024-11-07 16:29:45,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:45,723 INFO L225 Difference]: With dead ends: 202 [2024-11-07 16:29:45,723 INFO L226 Difference]: Without dead ends: 196 [2024-11-07 16:29:45,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=146, Invalid=1120, Unknown=2, NotChecked=138, Total=1406 [2024-11-07 16:29:45,725 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 91 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 261 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:45,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 811 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1068 Invalid, 0 Unknown, 261 Unchecked, 0.7s Time] [2024-11-07 16:29:45,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-07 16:29:45,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 185. [2024-11-07 16:29:45,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 167 states have (on average 1.281437125748503) internal successors, (214), 184 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:45,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 214 transitions. [2024-11-07 16:29:45,729 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 214 transitions. Word has length 28 [2024-11-07 16:29:45,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:45,729 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 214 transitions. [2024-11-07 16:29:45,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 27 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:45,729 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 214 transitions. [2024-11-07 16:29:45,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-07 16:29:45,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:45,729 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:45,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 16:29:45,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:29:45,933 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-07 16:29:45,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:45,934 INFO L85 PathProgramCache]: Analyzing trace with hash 607909674, now seen corresponding path program 1 times [2024-11-07 16:29:45,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:45,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567756891] [2024-11-07 16:29:45,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:45,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:45,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:46,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:46,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:46,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567756891] [2024-11-07 16:29:46,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567756891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:46,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:46,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 16:29:46,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109980111] [2024-11-07 16:29:46,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:46,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 16:29:46,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:46,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 16:29:46,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-07 16:29:46,133 INFO L87 Difference]: Start difference. First operand 185 states and 214 transitions. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:46,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:46,388 INFO L93 Difference]: Finished difference Result 204 states and 235 transitions. [2024-11-07 16:29:46,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 16:29:46,389 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-07 16:29:46,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:46,389 INFO L225 Difference]: With dead ends: 204 [2024-11-07 16:29:46,389 INFO L226 Difference]: Without dead ends: 204 [2024-11-07 16:29:46,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2024-11-07 16:29:46,390 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 111 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:46,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 278 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:29:46,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-07 16:29:46,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 184. [2024-11-07 16:29:46,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 167 states have (on average 1.2754491017964071) internal successors, (213), 183 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:46,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 213 transitions. [2024-11-07 16:29:46,392 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 213 transitions. Word has length 29 [2024-11-07 16:29:46,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:46,392 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 213 transitions. [2024-11-07 16:29:46,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:46,392 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 213 transitions. [2024-11-07 16:29:46,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-07 16:29:46,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:46,393 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:46,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-07 16:29:46,393 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-07 16:29:46,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:46,393 INFO L85 PathProgramCache]: Analyzing trace with hash 607909675, now seen corresponding path program 1 times [2024-11-07 16:29:46,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:46,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109854101] [2024-11-07 16:29:46,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:46,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:46,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:46,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:46,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:46,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109854101] [2024-11-07 16:29:46,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109854101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:46,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:46,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 16:29:46,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461613265] [2024-11-07 16:29:46,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:46,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 16:29:46,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:46,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 16:29:46,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-07 16:29:46,692 INFO L87 Difference]: Start difference. First operand 184 states and 213 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:47,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:47,058 INFO L93 Difference]: Finished difference Result 238 states and 275 transitions. [2024-11-07 16:29:47,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 16:29:47,059 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-07 16:29:47,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:47,059 INFO L225 Difference]: With dead ends: 238 [2024-11-07 16:29:47,059 INFO L226 Difference]: Without dead ends: 238 [2024-11-07 16:29:47,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2024-11-07 16:29:47,060 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 137 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:47,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 401 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 16:29:47,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-07 16:29:47,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 215. [2024-11-07 16:29:47,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 198 states have (on average 1.2575757575757576) internal successors, (249), 214 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:47,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 249 transitions. [2024-11-07 16:29:47,074 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 249 transitions. Word has length 29 [2024-11-07 16:29:47,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:47,074 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 249 transitions. [2024-11-07 16:29:47,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:47,074 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 249 transitions. [2024-11-07 16:29:47,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-07 16:29:47,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:47,075 INFO L215 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, 1, 1, 1] [2024-11-07 16:29:47,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-07 16:29:47,075 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-07 16:29:47,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:47,075 INFO L85 PathProgramCache]: Analyzing trace with hash 997305066, now seen corresponding path program 1 times [2024-11-07 16:29:47,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:47,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20305334] [2024-11-07 16:29:47,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:47,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:47,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:47,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:47,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20305334] [2024-11-07 16:29:47,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20305334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:47,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:47,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 16:29:47,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567826590] [2024-11-07 16:29:47,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:47,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 16:29:47,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:47,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 16:29:47,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:29:47,186 INFO L87 Difference]: Start difference. First operand 215 states and 249 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:47,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:47,445 INFO L93 Difference]: Finished difference Result 240 states and 272 transitions. [2024-11-07 16:29:47,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 16:29:47,445 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-07 16:29:47,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:47,446 INFO L225 Difference]: With dead ends: 240 [2024-11-07 16:29:47,446 INFO L226 Difference]: Without dead ends: 240 [2024-11-07 16:29:47,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-07 16:29:47,447 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 88 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:47,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 169 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:29:47,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-07 16:29:47,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 215. [2024-11-07 16:29:47,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 198 states have (on average 1.2525252525252526) internal successors, (248), 214 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:47,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 248 transitions. [2024-11-07 16:29:47,450 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 248 transitions. Word has length 31 [2024-11-07 16:29:47,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:47,450 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 248 transitions. [2024-11-07 16:29:47,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:47,450 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 248 transitions. [2024-11-07 16:29:47,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-07 16:29:47,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:47,451 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:47,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-07 16:29:47,451 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-07 16:29:47,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:47,451 INFO L85 PathProgramCache]: Analyzing trace with hash 851686138, now seen corresponding path program 1 times [2024-11-07 16:29:47,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:47,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244494209] [2024-11-07 16:29:47,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:47,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:47,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:47,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:47,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:47,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244494209] [2024-11-07 16:29:47,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244494209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:47,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:47,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:29:47,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019161199] [2024-11-07 16:29:47,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:47,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:29:47,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:47,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:29:47,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:29:47,505 INFO L87 Difference]: Start difference. First operand 215 states and 248 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 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) [2024-11-07 16:29:47,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:47,564 INFO L93 Difference]: Finished difference Result 221 states and 250 transitions. [2024-11-07 16:29:47,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:29:47,564 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 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 32 [2024-11-07 16:29:47,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:47,565 INFO L225 Difference]: With dead ends: 221 [2024-11-07 16:29:47,565 INFO L226 Difference]: Without dead ends: 221 [2024-11-07 16:29:47,565 INFO L431 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 [2024-11-07 16:29:47,565 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 18 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:47,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 263 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:29:47,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-07 16:29:47,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 215. [2024-11-07 16:29:47,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 198 states have (on average 1.2474747474747474) internal successors, (247), 214 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:47,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 247 transitions. [2024-11-07 16:29:47,568 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 247 transitions. Word has length 32 [2024-11-07 16:29:47,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:47,568 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 247 transitions. [2024-11-07 16:29:47,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 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) [2024-11-07 16:29:47,568 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 247 transitions. [2024-11-07 16:29:47,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-07 16:29:47,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:47,568 INFO L215 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] [2024-11-07 16:29:47,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-07 16:29:47,569 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-07 16:29:47,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:47,569 INFO L85 PathProgramCache]: Analyzing trace with hash 632465771, now seen corresponding path program 1 times [2024-11-07 16:29:47,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:47,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395405020] [2024-11-07 16:29:47,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:47,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:47,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:29:47,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:47,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395405020] [2024-11-07 16:29:47,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395405020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:47,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:47,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:29:47,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292323469] [2024-11-07 16:29:47,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:47,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:29:47,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:47,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:29:47,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:29:47,615 INFO L87 Difference]: Start difference. First operand 215 states and 247 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:47,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:47,819 INFO L93 Difference]: Finished difference Result 214 states and 245 transitions. [2024-11-07 16:29:47,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:29:47,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-07 16:29:47,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:47,820 INFO L225 Difference]: With dead ends: 214 [2024-11-07 16:29:47,820 INFO L226 Difference]: Without dead ends: 214 [2024-11-07 16:29:47,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:29:47,821 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 11 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:47,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 174 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:29:47,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-07 16:29:47,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2024-11-07 16:29:47,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 198 states have (on average 1.2373737373737375) internal successors, (245), 213 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:47,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 245 transitions. [2024-11-07 16:29:47,825 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 245 transitions. Word has length 33 [2024-11-07 16:29:47,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:47,825 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 245 transitions. [2024-11-07 16:29:47,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:47,825 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 245 transitions. [2024-11-07 16:29:47,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-07 16:29:47,826 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:47,826 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:47,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-07 16:29:47,826 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-07 16:29:47,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:47,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1155721340, now seen corresponding path program 1 times [2024-11-07 16:29:47,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:47,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666549778] [2024-11-07 16:29:47,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:47,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:47,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:48,321 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:48,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:48,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666549778] [2024-11-07 16:29:48,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666549778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:48,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:48,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-07 16:29:48,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332086941] [2024-11-07 16:29:48,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:48,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 16:29:48,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:48,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 16:29:48,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-07 16:29:48,324 INFO L87 Difference]: Start difference. First operand 214 states and 245 transitions. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 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) [2024-11-07 16:29:48,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:48,868 INFO L93 Difference]: Finished difference Result 239 states and 270 transitions. [2024-11-07 16:29:48,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-07 16:29:48,868 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 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 [2024-11-07 16:29:48,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:48,869 INFO L225 Difference]: With dead ends: 239 [2024-11-07 16:29:48,869 INFO L226 Difference]: Without dead ends: 232 [2024-11-07 16:29:48,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2024-11-07 16:29:48,869 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 166 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:48,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 498 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 16:29:48,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-07 16:29:48,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 212. [2024-11-07 16:29:48,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 196 states have (on average 1.2346938775510203) internal successors, (242), 211 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:48,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 242 transitions. [2024-11-07 16:29:48,872 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 242 transitions. Word has length 38 [2024-11-07 16:29:48,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:48,873 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 242 transitions. [2024-11-07 16:29:48,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 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) [2024-11-07 16:29:48,873 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 242 transitions. [2024-11-07 16:29:48,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-07 16:29:48,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:48,873 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:48,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-07 16:29:48,873 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-07 16:29:48,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:48,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1546128188, now seen corresponding path program 1 times [2024-11-07 16:29:48,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:48,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630638235] [2024-11-07 16:29:48,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:48,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:48,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:49,378 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:49,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:49,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630638235] [2024-11-07 16:29:49,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630638235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:49,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:49,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-07 16:29:49,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816113933] [2024-11-07 16:29:49,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:49,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 16:29:49,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:49,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 16:29:49,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-11-07 16:29:49,381 INFO L87 Difference]: Start difference. First operand 212 states and 242 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 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) [2024-11-07 16:29:49,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:49,789 INFO L93 Difference]: Finished difference Result 228 states and 259 transitions. [2024-11-07 16:29:49,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 16:29:49,790 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 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 [2024-11-07 16:29:49,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:49,790 INFO L225 Difference]: With dead ends: 228 [2024-11-07 16:29:49,791 INFO L226 Difference]: Without dead ends: 203 [2024-11-07 16:29:49,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2024-11-07 16:29:49,791 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 137 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:49,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 516 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 16:29:49,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-07 16:29:49,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 199. [2024-11-07 16:29:49,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 183 states have (on average 1.2459016393442623) internal successors, (228), 198 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:49,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 228 transitions. [2024-11-07 16:29:49,794 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 228 transitions. Word has length 38 [2024-11-07 16:29:49,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:49,794 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 228 transitions. [2024-11-07 16:29:49,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 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) [2024-11-07 16:29:49,794 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 228 transitions. [2024-11-07 16:29:49,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-07 16:29:49,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:49,795 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:49,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-07 16:29:49,795 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-07 16:29:49,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:49,795 INFO L85 PathProgramCache]: Analyzing trace with hash -936117449, now seen corresponding path program 1 times [2024-11-07 16:29:49,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:49,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46417129] [2024-11-07 16:29:49,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:49,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:49,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:50,212 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:50,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:50,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46417129] [2024-11-07 16:29:50,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46417129] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:29:50,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310292816] [2024-11-07 16:29:50,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:50,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:29:50,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:29:50,219 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:29:50,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 16:29:50,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:50,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-07 16:29:50,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:29:50,345 INFO L378 Elim1Store]: Elim1 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 [2024-11-07 16:29:50,348 INFO L378 Elim1Store]: Elim1 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 [2024-11-07 16:29:50,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-07 16:29:50,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-07 16:29:50,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-07 16:29:50,382 INFO L378 Elim1Store]: Elim1 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 [2024-11-07 16:29:50,643 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:29:50,643 INFO L378 Elim1Store]: Elim1 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 [2024-11-07 16:29:50,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:29:50,708 INFO L349 Elim1Store]: treesize reduction 23, result has 39.5 percent of original size [2024-11-07 16:29:50,708 INFO L378 Elim1Store]: Elim1 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 36 treesize of output 29 [2024-11-07 16:29:50,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:29:50,737 INFO L349 Elim1Store]: treesize reduction 42, result has 40.8 percent of original size [2024-11-07 16:29:50,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 45 [2024-11-07 16:29:50,912 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:29:50,913 INFO L378 Elim1Store]: Elim1 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 73 treesize of output 66 [2024-11-07 16:29:50,927 INFO L378 Elim1Store]: Elim1 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 56 treesize of output 35 [2024-11-07 16:29:51,069 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:29:51,069 INFO L378 Elim1Store]: Elim1 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 73 treesize of output 66 [2024-11-07 16:29:51,076 INFO L378 Elim1Store]: Elim1 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 56 treesize of output 35 [2024-11-07 16:29:51,243 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-07 16:29:51,243 INFO L378 Elim1Store]: Elim1 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 127 treesize of output 108 [2024-11-07 16:29:51,255 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-07 16:29:51,255 INFO L378 Elim1Store]: Elim1 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 127 treesize of output 114 [2024-11-07 16:29:51,462 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:51,462 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:29:51,483 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1429 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem24#1.base| v_ArrVal_1429) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_1428 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem24#1.base| v_ArrVal_1428) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0))) is different from false [2024-11-07 16:29:51,490 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)))) (and (forall ((v_ArrVal_1429 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1429) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_1428 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1428) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)))) is different from false [2024-11-07 16:29:51,502 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (and (forall ((v_ArrVal_1427 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1429 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem23#1.base| v_ArrVal_1427) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem23#1.base| v_ArrVal_1426) |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_1429) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1426 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem23#1.base| v_ArrVal_1426))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_1428)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)))) is different from false [2024-11-07 16:29:51,510 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1427 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1429 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1427) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1426) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1429) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1426 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1426))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1428)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0))))) is different from false [2024-11-07 16:29:51,525 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (and (forall ((v_ArrVal_1427 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1429 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_1425))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_1424) .cse0 v_ArrVal_1427) (select (select (store .cse1 .cse0 v_ArrVal_1426) |c_ULTIMATE.start_main_~n~0#1.base|) .cse2) v_ArrVal_1429))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1425 (Array Int Int))) (= (select (select (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_1425))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~n~0#1.base|) .cse2) v_ArrVal_1426)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~n~0#1.base|) .cse2) v_ArrVal_1428)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)))) is different from false [2024-11-07 16:29:51,617 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse0 |c_ULTIMATE.start_main_#t~malloc21#1.base|)))) (and (forall ((v_ArrVal_1427 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1429 (Array Int Int))) (= (select (select (let ((.cse2 (store .cse3 |c_ULTIMATE.start_main_#t~malloc21#1.base| v_ArrVal_1425))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse0))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~n~0#1.base|) .cse0 v_ArrVal_1422)) |c_ULTIMATE.start_main_#t~malloc21#1.base| v_ArrVal_1424) .cse1 v_ArrVal_1427) (select (select (store .cse2 .cse1 v_ArrVal_1426) |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_1429))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1425 (Array Int Int))) (= (select (select (let ((.cse4 (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_#t~malloc21#1.base| v_ArrVal_1425))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_1426)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_1428)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0))))) is different from false [2024-11-07 16:29:51,856 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:29:51,857 INFO L378 Elim1Store]: Elim1 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 194 treesize of output 212 [2024-11-07 16:29:51,909 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (and (forall ((v_ArrVal_1427 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_prenex_3 Int) (v_ArrVal_1422 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_ArrVal_1429 (Array Int Int))) (or (= (select (select (let ((.cse2 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse3 .cse0 v_prenex_3)) v_prenex_3 v_prenex_2))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse0))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~n~0#1.base|) .cse0 v_ArrVal_1422)) v_prenex_3 v_ArrVal_1424) .cse1 v_ArrVal_1427) (select (select (store .cse2 .cse1 v_prenex_1) |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_1429))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0) (= v_prenex_3 |c_ULTIMATE.start_main_~n~0#1.base|))) (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1425 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc21#1.base_9| Int)) (or (= (select (select (let ((.cse4 (let ((.cse5 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse3 .cse0 |v_ULTIMATE.start_main_#t~malloc21#1.base_9|)) |v_ULTIMATE.start_main_#t~malloc21#1.base_9| v_ArrVal_1425))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_1426)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_1428)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0) (= |v_ULTIMATE.start_main_#t~malloc21#1.base_9| |c_ULTIMATE.start_main_~n~0#1.base|))))) is different from false [2024-11-07 16:29:51,989 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2024-11-07 16:29:51,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310292816] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:29:51,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:29:51,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 15] total 36 [2024-11-07 16:29:51,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16339674] [2024-11-07 16:29:51,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:29:51,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-07 16:29:51,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:51,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-07 16:29:51,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=701, Unknown=15, NotChecked=420, Total=1260 [2024-11-07 16:29:51,992 INFO L87 Difference]: Start difference. First operand 199 states and 228 transitions. Second operand has 36 states, 36 states have (on average 2.7222222222222223) internal successors, (98), 36 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:29:54,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 16:29:56,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 16:29:58,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 16:30:00,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 16:30:02,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 16:30:10,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 16:30:14,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 16:30:17,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 16:30:17,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:17,318 INFO L93 Difference]: Finished difference Result 276 states and 319 transitions. [2024-11-07 16:30:17,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-07 16:30:17,318 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.7222222222222223) internal successors, (98), 36 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-07 16:30:17,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:17,319 INFO L225 Difference]: With dead ends: 276 [2024-11-07 16:30:17,319 INFO L226 Difference]: Without dead ends: 276 [2024-11-07 16:30:17,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 63 SyntacticMatches, 10 SemanticMatches, 59 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=493, Invalid=2378, Unknown=19, NotChecked=770, Total=3660 [2024-11-07 16:30:17,320 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 251 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 64 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 2850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 1606 IncrementalHoareTripleChecker+Unchecked, 18.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:17,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 1164 Invalid, 2850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1172 Invalid, 8 Unknown, 1606 Unchecked, 18.2s Time] [2024-11-07 16:30:17,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-11-07 16:30:17,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 223. [2024-11-07 16:30:17,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 207 states have (on average 1.2415458937198067) internal successors, (257), 222 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:17,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 257 transitions. [2024-11-07 16:30:17,323 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 257 transitions. Word has length 42 [2024-11-07 16:30:17,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:17,324 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 257 transitions. [2024-11-07 16:30:17,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.7222222222222223) internal successors, (98), 36 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:17,324 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 257 transitions. [2024-11-07 16:30:17,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-07 16:30:17,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:17,325 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:17,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 16:30:17,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:17,525 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-07 16:30:17,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:17,526 INFO L85 PathProgramCache]: Analyzing trace with hash -641397770, now seen corresponding path program 1 times [2024-11-07 16:30:17,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:17,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989395348] [2024-11-07 16:30:17,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:17,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:17,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:17,835 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:17,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:17,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989395348] [2024-11-07 16:30:17,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989395348] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:30:17,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829713592] [2024-11-07 16:30:17,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:17,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:17,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:30:17,842 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:30:17,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-07 16:30:17,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:17,972 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-07 16:30:17,973 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:30:18,270 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:18,270 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:30:18,383 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-07 16:30:18,383 INFO L378 Elim1Store]: Elim1 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 25 [2024-11-07 16:30:18,390 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-11-07 16:30:18,391 INFO L378 Elim1Store]: Elim1 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 24 treesize of output 12 [2024-11-07 16:30:18,442 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:18,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829713592] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:30:18,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:30:18,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2024-11-07 16:30:18,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537546722] [2024-11-07 16:30:18,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:30:18,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-07 16:30:18,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:18,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-07 16:30:18,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-11-07 16:30:18,444 INFO L87 Difference]: Start difference. First operand 223 states and 257 transitions. Second operand has 19 states, 19 states have (on average 4.315789473684211) internal successors, (82), 19 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:18,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:18,910 INFO L93 Difference]: Finished difference Result 280 states and 326 transitions. [2024-11-07 16:30:18,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 16:30:18,910 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.315789473684211) internal successors, (82), 19 states have internal predecessors, (82), 0 states have call successors, (0), 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 [2024-11-07 16:30:18,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:18,911 INFO L225 Difference]: With dead ends: 280 [2024-11-07 16:30:18,911 INFO L226 Difference]: Without dead ends: 280 [2024-11-07 16:30:18,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=599, Unknown=0, NotChecked=0, Total=756 [2024-11-07 16:30:18,912 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 273 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:18,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 694 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 16:30:18,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-07 16:30:18,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 253. [2024-11-07 16:30:18,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 237 states have (on average 1.2447257383966244) internal successors, (295), 252 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:18,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 295 transitions. [2024-11-07 16:30:18,915 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 295 transitions. Word has length 42 [2024-11-07 16:30:18,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:18,915 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 295 transitions. [2024-11-07 16:30:18,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.315789473684211) internal successors, (82), 19 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:18,916 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 295 transitions. [2024-11-07 16:30:18,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-07 16:30:18,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:18,916 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:18,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-07 16:30:19,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-11-07 16:30:19,121 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-07 16:30:19,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:19,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1652515020, now seen corresponding path program 1 times [2024-11-07 16:30:19,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:19,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840990449] [2024-11-07 16:30:19,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:19,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:19,744 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:19,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:19,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840990449] [2024-11-07 16:30:19,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840990449] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:30:19,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302483395] [2024-11-07 16:30:19,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:19,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:19,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:30:19,748 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:30:19,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-07 16:30:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:19,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-07 16:30:19,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:30:19,874 INFO L378 Elim1Store]: Elim1 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 [2024-11-07 16:30:19,878 INFO L378 Elim1Store]: Elim1 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 [2024-11-07 16:30:19,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-07 16:30:19,887 INFO L378 Elim1Store]: Elim1 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 [2024-11-07 16:30:20,062 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:30:20,063 INFO L378 Elim1Store]: Elim1 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 [2024-11-07 16:30:20,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-07 16:30:20,126 INFO L378 Elim1Store]: Elim1 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 34 treesize of output 25 [2024-11-07 16:30:20,237 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-07 16:30:20,238 INFO L378 Elim1Store]: Elim1 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 59 treesize of output 52 [2024-11-07 16:30:20,244 INFO L378 Elim1Store]: Elim1 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 20 [2024-11-07 16:30:20,323 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-07 16:30:20,323 INFO L378 Elim1Store]: Elim1 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 59 treesize of output 52 [2024-11-07 16:30:20,332 INFO L378 Elim1Store]: Elim1 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 20 [2024-11-07 16:30:20,413 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-07 16:30:20,413 INFO L378 Elim1Store]: Elim1 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 59 treesize of output 52 [2024-11-07 16:30:20,421 INFO L378 Elim1Store]: Elim1 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 20 [2024-11-07 16:30:20,490 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:30:20,490 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:30:20,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302483395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:30:20,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 16:30:20,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [19] total 29 [2024-11-07 16:30:20,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635797457] [2024-11-07 16:30:20,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:30:20,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 16:30:20,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:20,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 16:30:20,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2024-11-07 16:30:20,491 INFO L87 Difference]: Start difference. First operand 253 states and 295 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 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) [2024-11-07 16:30:20,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:20,962 INFO L93 Difference]: Finished difference Result 277 states and 321 transitions. [2024-11-07 16:30:20,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 16:30:20,962 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 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 42 [2024-11-07 16:30:20,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:20,963 INFO L225 Difference]: With dead ends: 277 [2024-11-07 16:30:20,963 INFO L226 Difference]: Without dead ends: 277 [2024-11-07 16:30:20,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=191, Invalid=1369, Unknown=0, NotChecked=0, Total=1560 [2024-11-07 16:30:20,964 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 52 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:20,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 555 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:30:20,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-11-07 16:30:20,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 264. [2024-11-07 16:30:20,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 248 states have (on average 1.2338709677419355) internal successors, (306), 263 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:20,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 306 transitions. [2024-11-07 16:30:20,968 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 306 transitions. Word has length 42 [2024-11-07 16:30:20,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:20,968 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 306 transitions. [2024-11-07 16:30:20,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 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) [2024-11-07 16:30:20,968 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 306 transitions. [2024-11-07 16:30:20,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-07 16:30:20,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:20,968 INFO L215 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, 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] [2024-11-07 16:30:21,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-07 16:30:21,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-11-07 16:30:21,169 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-07 16:30:21,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:21,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1377425632, now seen corresponding path program 1 times [2024-11-07 16:30:21,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:21,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549084522] [2024-11-07 16:30:21,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:21,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:21,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:21,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:21,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549084522] [2024-11-07 16:30:21,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549084522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:30:21,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:30:21,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-07 16:30:21,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450383613] [2024-11-07 16:30:21,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:30:21,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-07 16:30:21,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:21,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-07 16:30:21,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-11-07 16:30:21,689 INFO L87 Difference]: Start difference. First operand 264 states and 306 transitions. Second operand has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:22,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:22,242 INFO L93 Difference]: Finished difference Result 406 states and 484 transitions. [2024-11-07 16:30:22,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-07 16:30:22,242 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-07 16:30:22,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:22,246 INFO L225 Difference]: With dead ends: 406 [2024-11-07 16:30:22,246 INFO L226 Difference]: Without dead ends: 405 [2024-11-07 16:30:22,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=940, Unknown=0, NotChecked=0, Total=1122 [2024-11-07 16:30:22,247 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 266 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:22,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 810 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 16:30:22,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2024-11-07 16:30:22,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 365. [2024-11-07 16:30:22,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 349 states have (on average 1.2664756446991403) internal successors, (442), 364 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:22,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 442 transitions. [2024-11-07 16:30:22,251 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 442 transitions. Word has length 53 [2024-11-07 16:30:22,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:22,251 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 442 transitions. [2024-11-07 16:30:22,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:22,251 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 442 transitions. [2024-11-07 16:30:22,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-07 16:30:22,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:22,252 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:22,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-07 16:30:22,252 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-07 16:30:22,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:22,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1458762868, now seen corresponding path program 1 times [2024-11-07 16:30:22,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:22,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014593641] [2024-11-07 16:30:22,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:22,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:22,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:22,564 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:22,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:22,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014593641] [2024-11-07 16:30:22,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014593641] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:30:22,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770484132] [2024-11-07 16:30:22,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:22,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:22,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:30:22,567 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:30:22,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-07 16:30:22,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:22,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-07 16:30:22,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:30:22,799 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:30:22,799 INFO L378 Elim1Store]: Elim1 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 [2024-11-07 16:30:22,821 INFO L378 Elim1Store]: Elim1 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 19 treesize of output 1 [2024-11-07 16:30:22,869 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:30:22,869 INFO L378 Elim1Store]: Elim1 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 31 treesize of output 32 [2024-11-07 16:30:22,922 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:30:22,922 INFO L378 Elim1Store]: Elim1 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 42 treesize of output 41 [2024-11-07 16:30:22,956 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:30:22,956 INFO L378 Elim1Store]: Elim1 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 42 treesize of output 41 [2024-11-07 16:30:23,011 INFO L378 Elim1Store]: Elim1 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 31 treesize of output 13 [2024-11-07 16:30:23,014 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:23,014 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:30:23,093 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-07 16:30:23,094 INFO L378 Elim1Store]: Elim1 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 33 treesize of output 32 [2024-11-07 16:30:23,097 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1837 (Array Int Int)) (v_ArrVal_1836 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem23#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem23#1.base| v_ArrVal_1836))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)) v_ArrVal_1837)) |c_ULTIMATE.start_main_~root~0#1.base|) (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4)))) is different from false [2024-11-07 16:30:23,101 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1837 (Array Int Int)) (v_ArrVal_1836 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1836))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) .cse2) v_ArrVal_1837)) |c_ULTIMATE.start_main_~root~0#1.base|) (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4)))))) is different from false [2024-11-07 16:30:23,107 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1837 (Array Int Int)) (v_ArrVal_1836 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_1835)) (.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_1836))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1837)) |c_ULTIMATE.start_main_~root~0#1.base|) (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4)) .cse3)))) is different from false [2024-11-07 16:30:23,113 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1837 (Array Int Int)) (v_ArrVal_1836 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1835))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_1836))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1837)) |c_ULTIMATE.start_main_~root~0#1.base|) (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4)) .cse3))))) is different from false [2024-11-07 16:30:23,119 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:30:23,119 INFO L378 Elim1Store]: Elim1 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 107 treesize of output 68 [2024-11-07 16:30:23,134 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:30:23,134 INFO L378 Elim1Store]: Elim1 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 6492 treesize of output 5141 [2024-11-07 16:30:23,180 INFO L378 Elim1Store]: Elim1 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 422 treesize of output 394 [2024-11-07 16:30:23,189 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:30:23,189 INFO L378 Elim1Store]: Elim1 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 372 treesize of output 269 [2024-11-07 16:30:23,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:30:23,200 INFO L378 Elim1Store]: Elim1 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 260 treesize of output 217 [2024-11-07 16:30:23,539 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:30:23,539 INFO L378 Elim1Store]: Elim1 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 28 treesize of output 46 [2024-11-07 16:30:23,570 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:23,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770484132] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:30:23,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:30:23,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 26 [2024-11-07 16:30:23,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469836728] [2024-11-07 16:30:23,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:30:23,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-07 16:30:23,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:23,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-07 16:30:23,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=407, Unknown=20, NotChecked=180, Total=702 [2024-11-07 16:30:23,575 INFO L87 Difference]: Start difference. First operand 365 states and 442 transitions. Second operand has 27 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 27 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) [2024-11-07 16:30:24,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:24,326 INFO L93 Difference]: Finished difference Result 424 states and 505 transitions. [2024-11-07 16:30:24,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 16:30:24,326 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 27 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) Word has length 53 [2024-11-07 16:30:24,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:24,331 INFO L225 Difference]: With dead ends: 424 [2024-11-07 16:30:24,331 INFO L226 Difference]: Without dead ends: 424 [2024-11-07 16:30:24,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=727, Unknown=22, NotChecked=244, Total=1190 [2024-11-07 16:30:24,332 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 332 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 1061 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 2010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 905 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:24,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 965 Invalid, 2010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1061 Invalid, 0 Unknown, 905 Unchecked, 0.6s Time] [2024-11-07 16:30:24,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2024-11-07 16:30:24,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 369. [2024-11-07 16:30:24,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 353 states have (on average 1.2691218130311614) internal successors, (448), 368 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:24,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 448 transitions. [2024-11-07 16:30:24,340 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 448 transitions. Word has length 53 [2024-11-07 16:30:24,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:24,340 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 448 transitions. [2024-11-07 16:30:24,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 27 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) [2024-11-07 16:30:24,344 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 448 transitions. [2024-11-07 16:30:24,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-07 16:30:24,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:24,345 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:24,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-07 16:30:24,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2024-11-07 16:30:24,545 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2024-11-07 16:30:24,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:24,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1458762867, now seen corresponding path program 1 times [2024-11-07 16:30:24,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:24,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26069441] [2024-11-07 16:30:24,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:24,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:24,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:25,122 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:25,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:25,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26069441] [2024-11-07 16:30:25,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26069441] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:30:25,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570936779] [2024-11-07 16:30:25,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:25,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:25,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:30:25,125 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:30:25,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-07 16:30:25,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:25,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-07 16:30:25,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:30:25,337 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-07 16:30:25,337 INFO L378 Elim1Store]: Elim1 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 19 treesize of output 16 [2024-11-07 16:30:25,403 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:30:25,403 INFO L378 Elim1Store]: Elim1 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 [2024-11-07 16:30:25,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-11-07 16:30:25,430 INFO L378 Elim1Store]: Elim1 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 [2024-11-07 16:30:25,441 INFO L378 Elim1Store]: Elim1 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 19 treesize of output 1 [2024-11-07 16:30:25,511 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:30:25,511 INFO L378 Elim1Store]: Elim1 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 62 treesize of output 57 [2024-11-07 16:30:25,515 INFO L378 Elim1Store]: Elim1 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 30 treesize of output 13 [2024-11-07 16:30:25,570 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:30:25,570 INFO L378 Elim1Store]: Elim1 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 62 treesize of output 57 [2024-11-07 16:30:25,574 INFO L378 Elim1Store]: Elim1 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 30 treesize of output 13 [2024-11-07 16:30:25,617 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:30:25,617 INFO L378 Elim1Store]: Elim1 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 62 treesize of output 57 [2024-11-07 16:30:25,620 INFO L378 Elim1Store]: Elim1 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 30 treesize of output 13 [2024-11-07 16:30:25,696 INFO L378 Elim1Store]: Elim1 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 31 treesize of output 13 [2024-11-07 16:30:25,699 INFO L378 Elim1Store]: Elim1 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 9 treesize of output 3 [2024-11-07 16:30:25,728 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:25,728 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:30:25,836 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))) (and (forall ((v_ArrVal_1993 (Array Int Int)) (v_ArrVal_1992 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem24#1.base| v_ArrVal_1993) |c_ULTIMATE.start_main_~root~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem24#1.base| v_ArrVal_1992) |c_ULTIMATE.start_main_~root~0#1.base|) .cse0)))) (forall ((v_ArrVal_1993 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem24#1.base| v_ArrVal_1993) |c_ULTIMATE.start_main_~root~0#1.base|) .cse0))))) is different from false [2024-11-07 16:30:25,842 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (.cse1 (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))) (and (forall ((v_ArrVal_1993 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1993) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1))) (forall ((v_ArrVal_1993 (Array Int Int)) (v_ArrVal_1992 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1993) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1992) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1)))))) is different from false [2024-11-07 16:30:25,853 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))) (and (forall ((v_ArrVal_1993 (Array Int Int)) (v_ArrVal_1992 (Array Int Int)) (v_ArrVal_1991 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem23#1.base| v_ArrVal_1990))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse3))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem23#1.base| v_ArrVal_1991) .cse0 v_ArrVal_1993) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1992) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1993 (Array Int Int)) (v_ArrVal_1991 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem23#1.base| v_ArrVal_1991) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem23#1.base| v_ArrVal_1990) |c_ULTIMATE.start_main_~n~0#1.base|) .cse3) v_ArrVal_1993) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1))))) is different from false [2024-11-07 16:30:25,861 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1993 (Array Int Int)) (v_ArrVal_1991 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1991) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1990) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1993) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2))) (forall ((v_ArrVal_1993 (Array Int Int)) (v_ArrVal_1992 (Array Int Int)) (v_ArrVal_1991 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1990))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1991) .cse3 v_ArrVal_1993) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_1992) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2))))))))) is different from false [2024-11-07 16:30:25,875 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))) (and (forall ((v_ArrVal_1989 (Array Int Int)) (v_ArrVal_1988 (Array Int Int)) (v_ArrVal_1993 (Array Int Int)) (v_ArrVal_1992 (Array Int Int)) (v_ArrVal_1991 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_1989))) (let ((.cse0 (select (select .cse5 |c_ULTIMATE.start_main_~n~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse0 v_ArrVal_1990))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~n~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_1988) .cse0 v_ArrVal_1991) .cse1 v_ArrVal_1993) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1992) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1989 (Array Int Int)) (v_ArrVal_1988 (Array Int Int)) (v_ArrVal_1993 (Array Int Int)) (v_ArrVal_1991 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (<= 0 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_1989))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~n~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_1988) .cse6 v_ArrVal_1991) (select (select (store .cse7 .cse6 v_ArrVal_1990) |c_ULTIMATE.start_main_~n~0#1.base|) .cse4) v_ArrVal_1993))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2))))) is different from false [2024-11-07 16:30:25,886 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1989 (Array Int Int)) (v_ArrVal_1988 (Array Int Int)) (v_ArrVal_1993 (Array Int Int)) (v_ArrVal_1991 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (<= 0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1989))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1988) .cse1 v_ArrVal_1991) (select (select (store .cse2 .cse1 v_ArrVal_1990) |c_ULTIMATE.start_main_~n~0#1.base|) .cse3) v_ArrVal_1993))) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (forall ((v_ArrVal_1989 (Array Int Int)) (v_ArrVal_1988 (Array Int Int)) (v_ArrVal_1993 (Array Int Int)) (v_ArrVal_1992 (Array Int Int)) (v_ArrVal_1991 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1989))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~n~0#1.base|) .cse3))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_1990))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~n~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1988) .cse5 v_ArrVal_1991) .cse6 v_ArrVal_1993) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4) 4) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_1992) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))))))))))) is different from false [2024-11-07 16:30:25,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:30:25,899 INFO L378 Elim1Store]: Elim1 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 177 treesize of output 178 [2024-11-07 16:30:25,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:30:25,903 INFO L378 Elim1Store]: Elim1 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 167 treesize of output 108 [2024-11-07 16:30:25,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:30:25,919 INFO L378 Elim1Store]: Elim1 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 23870 treesize of output 19567 [2024-11-07 16:30:26,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:30:26,125 INFO L378 Elim1Store]: Elim1 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 22362 treesize of output 21599 [2024-11-07 16:30:26,302 INFO L378 Elim1Store]: Elim1 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 7072 treesize of output 6624 [2024-11-07 16:30:26,337 INFO L378 Elim1Store]: Elim1 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 6624 treesize of output 6496 [2024-11-07 16:30:26,371 INFO L378 Elim1Store]: Elim1 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 6496 treesize of output 6048 [2024-11-07 16:30:26,413 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:30:26,413 INFO L378 Elim1Store]: Elim1 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 6048 treesize of output 4752 [2024-11-07 16:30:26,461 INFO L378 Elim1Store]: Elim1 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 4744 treesize of output 4616 [2024-11-07 16:30:26,503 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:30:26,503 INFO L378 Elim1Store]: Elim1 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 4616 treesize of output 4096