./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-memory-alloca/cstrcpy-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-memory-alloca/cstrcpy-alloca-2.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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', '64bit', '--witnessprinter.graph.data.programhash', '624eab544b12ce67976c98f49727abb376f7f963832aa58f07a7fb9fd050787e'] 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/termination-memory-alloca/cstrcpy-alloca-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash 624eab544b12ce67976c98f49727abb376f7f963832aa58f07a7fb9fd050787e --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 16:20:14,434 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 16:20:14,510 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-07 16:20:14,515 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 16:20:14,515 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 16:20:14,541 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 16:20:14,543 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 16:20:14,544 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 16:20:14,544 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 16:20:14,545 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 16:20:14,545 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 16:20:14,545 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 16:20:14,546 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 16:20:14,546 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 16:20:14,546 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 16:20:14,547 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 16:20:14,547 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 16:20:14,547 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 16:20:14,547 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 16:20:14,547 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 16:20:14,547 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 16:20:14,547 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 16:20:14,547 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 16:20:14,547 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 16:20:14,547 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 16:20:14,547 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 16:20:14,547 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 16:20:14,547 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 16:20:14,547 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 16:20:14,548 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 16:20:14,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:20:14,548 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 16:20:14,548 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 16:20:14,548 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 16:20:14,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 16:20:14,548 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 16:20:14,548 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 16:20:14,548 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 16:20:14,549 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 16:20:14,549 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 624eab544b12ce67976c98f49727abb376f7f963832aa58f07a7fb9fd050787e [2024-11-07 16:20:14,832 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 16:20:14,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 16:20:14,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 16:20:14,846 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 16:20:14,847 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 16:20:14,848 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/cstrcpy-alloca-2.i [2024-11-07 16:20:16,185 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 16:20:16,494 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 16:20:16,496 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/cstrcpy-alloca-2.i [2024-11-07 16:20:16,511 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/013152412/af23e44f1dd54eedb27382db4dd83f90/FLAG8c40ed65c [2024-11-07 16:20:16,531 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/013152412/af23e44f1dd54eedb27382db4dd83f90 [2024-11-07 16:20:16,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 16:20:16,536 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 16:20:16,537 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 16:20:16,537 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 16:20:16,541 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 16:20:16,542 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:20:16" (1/1) ... [2024-11-07 16:20:16,544 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e08ff4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:20:16, skipping insertion in model container [2024-11-07 16:20:16,544 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:20:16" (1/1) ... [2024-11-07 16:20:16,572 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 16:20:16,794 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:20:16,794 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:20:16,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:20:16,804 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 16:20:16,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:20:16,883 INFO L204 MainTranslator]: Completed translation [2024-11-07 16:20:16,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:20:16 WrapperNode [2024-11-07 16:20:16,884 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 16:20:16,885 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 16:20:16,885 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 16:20:16,885 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 16:20:16,889 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:20:16" (1/1) ... [2024-11-07 16:20:16,897 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:20:16" (1/1) ... [2024-11-07 16:20:16,909 INFO L138 Inliner]: procedures = 111, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 58 [2024-11-07 16:20:16,909 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 16:20:16,910 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 16:20:16,910 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 16:20:16,910 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 16:20:16,916 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:20:16" (1/1) ... [2024-11-07 16:20:16,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:20:16" (1/1) ... [2024-11-07 16:20:16,918 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:20:16" (1/1) ... [2024-11-07 16:20:16,929 INFO L175 MemorySlicer]: Split 3 memory accesses to 2 slices as follows [2, 1]. 67 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 2 writes are split as follows [1, 1]. [2024-11-07 16:20:16,929 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:20:16" (1/1) ... [2024-11-07 16:20:16,929 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:20:16" (1/1) ... [2024-11-07 16:20:16,935 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:20:16" (1/1) ... [2024-11-07 16:20:16,938 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:20:16" (1/1) ... [2024-11-07 16:20:16,939 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:20:16" (1/1) ... [2024-11-07 16:20:16,939 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:20:16" (1/1) ... [2024-11-07 16:20:16,941 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 16:20:16,942 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 16:20:16,942 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 16:20:16,942 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 16:20:16,943 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:20:16" (1/1) ... [2024-11-07 16:20:16,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:20:16,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:20:16,973 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:20:16,976 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:20:16,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 16:20:16,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 16:20:16,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 16:20:16,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 16:20:16,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-07 16:20:17,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 16:20:17,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 16:20:17,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 16:20:17,084 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 16:20:17,086 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 16:20:17,202 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2024-11-07 16:20:17,202 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 16:20:17,209 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 16:20:17,209 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 16:20:17,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:20:17 BoogieIcfgContainer [2024-11-07 16:20:17,210 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 16:20:17,212 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 16:20:17,212 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 16:20:17,217 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 16:20:17,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:20:16" (1/3) ... [2024-11-07 16:20:17,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f3b8fc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:20:17, skipping insertion in model container [2024-11-07 16:20:17,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:20:16" (2/3) ... [2024-11-07 16:20:17,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f3b8fc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:20:17, skipping insertion in model container [2024-11-07 16:20:17,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:20:17" (3/3) ... [2024-11-07 16:20:17,219 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrcpy-alloca-2.i [2024-11-07 16:20:17,232 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 16:20:17,233 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-07 16:20:17,262 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 16:20:17,274 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;@29a162af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 16:20:17,274 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-07 16:20:17,279 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.8) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:20:17,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-07 16:20:17,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:20:17,285 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-07 16:20:17,285 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-07 16:20:17,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:20:17,290 INFO L85 PathProgramCache]: Analyzing trace with hash 889510823, now seen corresponding path program 1 times [2024-11-07 16:20:17,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:20:17,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533663447] [2024-11-07 16:20:17,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:20:17,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:20:17,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:20:17,478 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:20:17,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:20:17,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533663447] [2024-11-07 16:20:17,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533663447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:20:17,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:20:17,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:20:17,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514679981] [2024-11-07 16:20:17,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:20:17,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:20:17,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:20:17,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:20:17,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:20:17,508 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.8) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:20:17,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:20:17,561 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2024-11-07 16:20:17,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:20:17,565 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-07 16:20:17,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:20:17,570 INFO L225 Difference]: With dead ends: 24 [2024-11-07 16:20:17,570 INFO L226 Difference]: Without dead ends: 22 [2024-11-07 16:20:17,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:20:17,574 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 2 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:20:17,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 58 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:20:17,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-07 16:20:17,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-07 16:20:17,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 21 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:20:17,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2024-11-07 16:20:17,602 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 6 [2024-11-07 16:20:17,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:20:17,602 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-11-07 16:20:17,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:20:17,603 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2024-11-07 16:20:17,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-07 16:20:17,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:20:17,604 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-07 16:20:17,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 16:20:17,605 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-07 16:20:17,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:20:17,605 INFO L85 PathProgramCache]: Analyzing trace with hash 889510859, now seen corresponding path program 1 times [2024-11-07 16:20:17,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:20:17,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564180615] [2024-11-07 16:20:17,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:20:17,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:20:17,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:20:17,900 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:20:17,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:20:17,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564180615] [2024-11-07 16:20:17,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564180615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:20:17,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:20:17,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:20:17,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117996553] [2024-11-07 16:20:17,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:20:17,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:20:17,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:20:17,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:20:17,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:20:17,903 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:20:17,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:20:17,946 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2024-11-07 16:20:17,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:20:17,947 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-07 16:20:17,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:20:17,947 INFO L225 Difference]: With dead ends: 22 [2024-11-07 16:20:17,947 INFO L226 Difference]: Without dead ends: 22 [2024-11-07 16:20:17,948 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:20:17,949 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 3 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:20:17,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 45 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:20:17,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-07 16:20:17,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2024-11-07 16:20:17,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.6) internal successors, (24), 20 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:20:17,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2024-11-07 16:20:17,953 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 6 [2024-11-07 16:20:17,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:20:17,953 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2024-11-07 16:20:17,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:20:17,953 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2024-11-07 16:20:17,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-07 16:20:17,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:20:17,954 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-07 16:20:17,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 16:20:17,954 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-07 16:20:17,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:20:17,954 INFO L85 PathProgramCache]: Analyzing trace with hash 889510860, now seen corresponding path program 1 times [2024-11-07 16:20:17,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:20:17,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522277705] [2024-11-07 16:20:17,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:20:17,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:20:17,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:20:18,151 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:20:18,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:20:18,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522277705] [2024-11-07 16:20:18,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522277705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:20:18,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:20:18,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:20:18,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408140779] [2024-11-07 16:20:18,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:20:18,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:20:18,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:20:18,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:20:18,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:20:18,155 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:20:18,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:20:18,191 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2024-11-07 16:20:18,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:20:18,192 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-07 16:20:18,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:20:18,192 INFO L225 Difference]: With dead ends: 22 [2024-11-07 16:20:18,192 INFO L226 Difference]: Without dead ends: 22 [2024-11-07 16:20:18,193 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:20:18,193 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:20:18,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:20:18,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-07 16:20:18,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-07 16:20:18,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.5625) internal successors, (25), 21 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:20:18,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2024-11-07 16:20:18,198 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 6 [2024-11-07 16:20:18,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:20:18,198 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-11-07 16:20:18,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:20:18,198 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2024-11-07 16:20:18,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-07 16:20:18,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:20:18,199 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-07 16:20:18,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 16:20:18,199 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-07 16:20:18,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:20:18,200 INFO L85 PathProgramCache]: Analyzing trace with hash 889512745, now seen corresponding path program 1 times [2024-11-07 16:20:18,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:20:18,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699181056] [2024-11-07 16:20:18,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:20:18,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:20:18,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:20:18,223 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:20:18,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:20:18,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699181056] [2024-11-07 16:20:18,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699181056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:20:18,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:20:18,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:20:18,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322012356] [2024-11-07 16:20:18,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:20:18,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:20:18,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:20:18,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:20:18,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:20:18,226 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:20:18,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:20:18,246 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2024-11-07 16:20:18,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:20:18,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-07 16:20:18,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:20:18,248 INFO L225 Difference]: With dead ends: 23 [2024-11-07 16:20:18,248 INFO L226 Difference]: Without dead ends: 22 [2024-11-07 16:20:18,248 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:20:18,249 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:20:18,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 30 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:20:18,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-07 16:20:18,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-07 16:20:18,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.5) internal successors, (24), 21 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:20:18,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2024-11-07 16:20:18,254 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 6 [2024-11-07 16:20:18,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:20:18,254 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2024-11-07 16:20:18,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:20:18,255 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2024-11-07 16:20:18,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-07 16:20:18,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:20:18,255 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-07 16:20:18,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 16:20:18,255 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-07 16:20:18,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:20:18,256 INFO L85 PathProgramCache]: Analyzing trace with hash 889512782, now seen corresponding path program 1 times [2024-11-07 16:20:18,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:20:18,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294423922] [2024-11-07 16:20:18,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:20:18,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:20:18,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:20:18,401 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:20:18,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:20:18,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294423922] [2024-11-07 16:20:18,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294423922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:20:18,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:20:18,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:20:18,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159537341] [2024-11-07 16:20:18,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:20:18,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:20:18,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:20:18,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:20:18,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:20:18,403 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:20:18,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:20:18,420 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2024-11-07 16:20:18,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:20:18,421 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-07 16:20:18,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:20:18,421 INFO L225 Difference]: With dead ends: 21 [2024-11-07 16:20:18,421 INFO L226 Difference]: Without dead ends: 21 [2024-11-07 16:20:18,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:20:18,422 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:20:18,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 35 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:20:18,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-07 16:20:18,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2024-11-07 16:20:18,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.5) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 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:20:18,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2024-11-07 16:20:18,424 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 6 [2024-11-07 16:20:18,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:20:18,427 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-11-07 16:20:18,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:20:18,427 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2024-11-07 16:20:18,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-07 16:20:18,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:20:18,427 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:20:18,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 16:20:18,428 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-07 16:20:18,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:20:18,429 INFO L85 PathProgramCache]: Analyzing trace with hash -530222641, now seen corresponding path program 1 times [2024-11-07 16:20:18,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:20:18,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71586794] [2024-11-07 16:20:18,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:20:18,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:20:18,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:20:18,510 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:20:18,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:20:18,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71586794] [2024-11-07 16:20:18,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71586794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:20:18,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:20:18,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:20:18,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838260549] [2024-11-07 16:20:18,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:20:18,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:20:18,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:20:18,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:20:18,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:20:18,512 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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:20:18,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:20:18,562 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2024-11-07 16:20:18,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:20:18,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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:20:18,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:20:18,563 INFO L225 Difference]: With dead ends: 18 [2024-11-07 16:20:18,563 INFO L226 Difference]: Without dead ends: 18 [2024-11-07 16:20:18,563 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:20:18,563 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:20:18,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 30 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:20:18,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-07 16:20:18,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-07 16:20:18,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:20:18,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2024-11-07 16:20:18,570 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 9 [2024-11-07 16:20:18,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:20:18,570 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2024-11-07 16:20:18,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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:20:18,570 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2024-11-07 16:20:18,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-07 16:20:18,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:20:18,571 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:20:18,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 16:20:18,571 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-07 16:20:18,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:20:18,572 INFO L85 PathProgramCache]: Analyzing trace with hash -530222640, now seen corresponding path program 1 times [2024-11-07 16:20:18,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:20:18,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142522145] [2024-11-07 16:20:18,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:20:18,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:20:18,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:20:18,768 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:20:18,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:20:18,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142522145] [2024-11-07 16:20:18,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142522145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:20:18,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:20:18,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 16:20:18,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589300465] [2024-11-07 16:20:18,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:20:18,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 16:20:18,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:20:18,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 16:20:18,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:20:18,770 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 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:20:18,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:20:18,820 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2024-11-07 16:20:18,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 16:20:18,821 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 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:20:18,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:20:18,823 INFO L225 Difference]: With dead ends: 20 [2024-11-07 16:20:18,823 INFO L226 Difference]: Without dead ends: 20 [2024-11-07 16:20:18,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:20:18,824 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:20:18,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:20:18,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-07 16:20:18,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-07 16:20:18,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.375) internal successors, (22), 19 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:20:18,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2024-11-07 16:20:18,826 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 9 [2024-11-07 16:20:18,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:20:18,828 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-11-07 16:20:18,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 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:20:18,829 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2024-11-07 16:20:18,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-07 16:20:18,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:20:18,829 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:20:18,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 16:20:18,830 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-07 16:20:18,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:20:18,830 INFO L85 PathProgramCache]: Analyzing trace with hash 742967315, now seen corresponding path program 1 times [2024-11-07 16:20:18,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:20:18,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095379690] [2024-11-07 16:20:18,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:20:18,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:20:18,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:20:18,948 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:20:18,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:20:18,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095379690] [2024-11-07 16:20:18,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095379690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:20:18,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:20:18,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:20:18,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527604758] [2024-11-07 16:20:18,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:20:18,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:20:18,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:20:18,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:20:18,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:20:18,949 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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:20:18,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:20:18,993 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2024-11-07 16:20:18,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:20:18,994 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2024-11-07 16:20:18,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:20:18,994 INFO L225 Difference]: With dead ends: 19 [2024-11-07 16:20:18,994 INFO L226 Difference]: Without dead ends: 19 [2024-11-07 16:20:18,994 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:20:18,995 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:20:18,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 29 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:20:18,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-07 16:20:18,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-07 16:20:18,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 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:20:18,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2024-11-07 16:20:18,997 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 10 [2024-11-07 16:20:18,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:20:18,999 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-11-07 16:20:19,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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:20:19,000 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2024-11-07 16:20:19,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-07 16:20:19,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:20:19,001 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:20:19,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 16:20:19,001 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-07 16:20:19,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:20:19,002 INFO L85 PathProgramCache]: Analyzing trace with hash 742967316, now seen corresponding path program 1 times [2024-11-07 16:20:19,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:20:19,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484015581] [2024-11-07 16:20:19,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:20:19,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:20:19,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:20:19,200 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:20:19,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:20:19,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484015581] [2024-11-07 16:20:19,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484015581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:20:19,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:20:19,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:20:19,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437410083] [2024-11-07 16:20:19,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:20:19,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:20:19,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:20:19,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:20:19,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:20:19,203 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 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:20:19,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:20:19,246 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2024-11-07 16:20:19,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:20:19,247 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2024-11-07 16:20:19,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:20:19,247 INFO L225 Difference]: With dead ends: 26 [2024-11-07 16:20:19,247 INFO L226 Difference]: Without dead ends: 26 [2024-11-07 16:20:19,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:20:19,249 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 1 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:20:19,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 51 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:20:19,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-07 16:20:19,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-07 16:20:19,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 25 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:20:19,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2024-11-07 16:20:19,256 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 10 [2024-11-07 16:20:19,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:20:19,256 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2024-11-07 16:20:19,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 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:20:19,257 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2024-11-07 16:20:19,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-07 16:20:19,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:20:19,257 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:20:19,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 16:20:19,257 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-07 16:20:19,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:20:19,257 INFO L85 PathProgramCache]: Analyzing trace with hash -66379310, now seen corresponding path program 1 times [2024-11-07 16:20:19,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:20:19,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107627299] [2024-11-07 16:20:19,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:20:19,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:20:19,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:20:19,430 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:20:19,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:20:19,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107627299] [2024-11-07 16:20:19,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107627299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:20:19,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:20:19,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 16:20:19,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134386383] [2024-11-07 16:20:19,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:20:19,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 16:20:19,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:20:19,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 16:20:19,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:20:19,432 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 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:20:19,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:20:19,473 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2024-11-07 16:20:19,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 16:20:19,473 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2024-11-07 16:20:19,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:20:19,474 INFO L225 Difference]: With dead ends: 27 [2024-11-07 16:20:19,474 INFO L226 Difference]: Without dead ends: 27 [2024-11-07 16:20:19,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:20:19,475 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:20:19,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 41 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:20:19,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-07 16:20:19,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2024-11-07 16:20:19,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 19 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:20:19,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2024-11-07 16:20:19,478 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 10 [2024-11-07 16:20:19,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:20:19,478 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-11-07 16:20:19,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 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:20:19,478 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2024-11-07 16:20:19,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-07 16:20:19,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:20:19,479 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:20:19,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 16:20:19,479 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-07 16:20:19,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:20:19,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1772813464, now seen corresponding path program 1 times [2024-11-07 16:20:19,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:20:19,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70438356] [2024-11-07 16:20:19,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:20:19,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:20:19,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:20:19,666 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:20:19,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:20:19,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70438356] [2024-11-07 16:20:19,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70438356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:20:19,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:20:19,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 16:20:19,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078892361] [2024-11-07 16:20:19,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:20:19,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 16:20:19,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:20:19,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 16:20:19,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:20:19,668 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 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:20:19,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:20:19,711 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2024-11-07 16:20:19,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:20:19,712 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 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:20:19,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:20:19,712 INFO L225 Difference]: With dead ends: 27 [2024-11-07 16:20:19,712 INFO L226 Difference]: Without dead ends: 27 [2024-11-07 16:20:19,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:20:19,713 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:20:19,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:20:19,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-07 16:20:19,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-07 16:20:19,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 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:20:19,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2024-11-07 16:20:19,719 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 13 [2024-11-07 16:20:19,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:20:19,720 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2024-11-07 16:20:19,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 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:20:19,720 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2024-11-07 16:20:19,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-07 16:20:19,720 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:20:19,720 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:20:19,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 16:20:19,720 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-07 16:20:19,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:20:19,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1379786454, now seen corresponding path program 1 times [2024-11-07 16:20:19,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:20:19,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484417696] [2024-11-07 16:20:19,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:20:19,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:20:19,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:20:19,900 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:20:19,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:20:19,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484417696] [2024-11-07 16:20:19,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484417696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:20:19,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:20:19,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 16:20:19,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459304568] [2024-11-07 16:20:19,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:20:19,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 16:20:19,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:20:19,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 16:20:19,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:20:19,902 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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:20:19,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:20:19,960 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2024-11-07 16:20:19,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 16:20:19,961 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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:20:19,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:20:19,962 INFO L225 Difference]: With dead ends: 42 [2024-11-07 16:20:19,963 INFO L226 Difference]: Without dead ends: 42 [2024-11-07 16:20:19,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:20:19,964 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:20:19,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 71 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:20:19,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-07 16:20:19,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 28. [2024-11-07 16:20:19,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 25 states have (on average 1.24) internal successors, (31), 27 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:20:19,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2024-11-07 16:20:19,967 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 13 [2024-11-07 16:20:19,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:20:19,967 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2024-11-07 16:20:19,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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:20:19,967 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2024-11-07 16:20:19,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-07 16:20:19,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:20:19,970 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:20:19,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 16:20:19,970 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-07 16:20:19,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:20:19,971 INFO L85 PathProgramCache]: Analyzing trace with hash 2080851032, now seen corresponding path program 1 times [2024-11-07 16:20:19,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:20:19,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803842950] [2024-11-07 16:20:19,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:20:19,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:20:19,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:20:20,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:20:20,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:20:20,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803842950] [2024-11-07 16:20:20,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803842950] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:20:20,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827730075] [2024-11-07 16:20:20,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:20:20,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:20:20,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:20:20,343 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:20:20,344 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:20:20,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:20:20,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-07 16:20:20,439 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:20:20,508 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 14 treesize of output 10 [2024-11-07 16:20:20,753 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:20:20,753 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 20 treesize of output 17 [2024-11-07 16:20:20,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:20:20,903 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:20:21,217 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 15 treesize of output 13 [2024-11-07 16:20:21,226 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 20 treesize of output 16 [2024-11-07 16:20:21,239 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 13 treesize of output 9 [2024-11-07 16:20:21,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:20:21,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827730075] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:20:21,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:20:21,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2024-11-07 16:20:21,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189122412] [2024-11-07 16:20:21,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:20:21,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-07 16:20:21,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:20:21,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-07 16:20:21,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2024-11-07 16:20:21,257 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 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:20:21,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:20:21,472 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2024-11-07 16:20:21,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 16:20:21,472 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 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 13 [2024-11-07 16:20:21,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:20:21,473 INFO L225 Difference]: With dead ends: 31 [2024-11-07 16:20:21,473 INFO L226 Difference]: Without dead ends: 31 [2024-11-07 16:20:21,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2024-11-07 16:20:21,475 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:20:21,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:20:21,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-07 16:20:21,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-07 16:20:21,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 28 states have (on average 1.25) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:20:21,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-11-07 16:20:21,477 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 13 [2024-11-07 16:20:21,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:20:21,477 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-11-07 16:20:21,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 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:20:21,478 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-11-07 16:20:21,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-07 16:20:21,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:20:21,478 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:20:21,498 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:20:21,684 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,SelfDestructingSolverStorable12 [2024-11-07 16:20:21,685 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-07 16:20:21,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:20:21,685 INFO L85 PathProgramCache]: Analyzing trace with hash -877402150, now seen corresponding path program 1 times [2024-11-07 16:20:21,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:20:21,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852320442] [2024-11-07 16:20:21,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:20:21,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:20:21,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:20:21,794 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:20:21,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:20:21,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852320442] [2024-11-07 16:20:21,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852320442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:20:21,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:20:21,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:20:21,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731264989] [2024-11-07 16:20:21,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:20:21,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:20:21,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:20:21,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:20:21,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:20:21,797 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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:20:21,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:20:21,811 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2024-11-07 16:20:21,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:20:21,812 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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:20:21,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:20:21,812 INFO L225 Difference]: With dead ends: 30 [2024-11-07 16:20:21,812 INFO L226 Difference]: Without dead ends: 19 [2024-11-07 16:20:21,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:20:21,814 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 5 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:20:21,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 24 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:20:21,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-07 16:20:21,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-07 16:20:21,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 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:20:21,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2024-11-07 16:20:21,817 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 14 [2024-11-07 16:20:21,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:20:21,817 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2024-11-07 16:20:21,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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:20:21,818 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2024-11-07 16:20:21,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-07 16:20:21,818 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:20:21,818 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:20:21,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 16:20:21,819 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-07 16:20:21,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:20:21,819 INFO L85 PathProgramCache]: Analyzing trace with hash 81872524, now seen corresponding path program 1 times [2024-11-07 16:20:21,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:20:21,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685723150] [2024-11-07 16:20:21,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:20:21,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:20:21,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:20:22,356 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:20:22,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:20:22,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685723150] [2024-11-07 16:20:22,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685723150] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:20:22,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635262456] [2024-11-07 16:20:22,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:20:22,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:20:22,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:20:22,359 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:20:22,361 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:20:22,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:20:22,437 WARN L253 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-07 16:20:22,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:20:22,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 16:20:22,523 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 13 treesize of output 1 [2024-11-07 16:20:22,539 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 10 treesize of output 8 [2024-11-07 16:20:22,610 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 17 treesize of output 13 [2024-11-07 16:20:22,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:20:22,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 19 [2024-11-07 16:20:23,322 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:20:23,322 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:20:23,664 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 13 treesize of output 11 [2024-11-07 16:20:23,669 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 14 treesize of output 12 [2024-11-07 16:20:23,729 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:20:23,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:20:23,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635262456] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:20:23,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:20:23,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2024-11-07 16:20:23,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437445828] [2024-11-07 16:20:23,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:20:23,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-07 16:20:23,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:20:23,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-07 16:20:23,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=892, Unknown=0, NotChecked=0, Total=992 [2024-11-07 16:20:23,857 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 32 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 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:20:24,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:20:24,551 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2024-11-07 16:20:24,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 16:20:24,551 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 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:20:24,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:20:24,552 INFO L225 Difference]: With dead ends: 19 [2024-11-07 16:20:24,552 INFO L226 Difference]: Without dead ends: 19 [2024-11-07 16:20:24,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=180, Invalid=1626, Unknown=0, NotChecked=0, Total=1806 [2024-11-07 16:20:24,553 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 6 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:20:24,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 46 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:20:24,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-07 16:20:24,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2024-11-07 16:20:24,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:20:24,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2024-11-07 16:20:24,555 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 14 [2024-11-07 16:20:24,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:20:24,555 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2024-11-07 16:20:24,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 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:20:24,556 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2024-11-07 16:20:24,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-07 16:20:24,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:20:24,556 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:20:24,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 16:20:24,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-07 16:20:24,757 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-07 16:20:24,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:20:24,766 INFO L85 PathProgramCache]: Analyzing trace with hash -477082848, now seen corresponding path program 2 times [2024-11-07 16:20:24,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:20:24,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329796539] [2024-11-07 16:20:24,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:20:24,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:20:24,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:20:25,217 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:20:25,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:20:25,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329796539] [2024-11-07 16:20:25,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329796539] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:20:25,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119406878] [2024-11-07 16:20:25,218 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:20:25,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:20:25,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:20:25,221 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:20:25,222 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:20:25,300 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 16:20:25,301 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:20:25,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-07 16:20:25,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:20:25,359 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 14 treesize of output 10 [2024-11-07 16:20:30,088 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2024-11-07 16:20:30,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 23 [2024-11-07 16:20:30,163 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:20:30,164 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:20:30,595 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 21 treesize of output 17 [2024-11-07 16:20:30,602 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 29 treesize of output 25 [2024-11-07 16:20:30,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2024-11-07 16:20:30,689 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:20:30,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119406878] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:20:30,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:20:30,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 30 [2024-11-07 16:20:30,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951264508] [2024-11-07 16:20:30,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:20:30,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-07 16:20:30,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:20:30,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-07 16:20:30,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=824, Unknown=2, NotChecked=0, Total=930 [2024-11-07 16:20:30,692 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 31 states, 30 states have (on average 1.4) internal successors, (42), 31 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:20:33,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.71s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 16:20:37,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:20:37,604 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2024-11-07 16:20:37,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 16:20:37,605 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.4) internal successors, (42), 31 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 17 [2024-11-07 16:20:37,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:20:37,605 INFO L225 Difference]: With dead ends: 17 [2024-11-07 16:20:37,605 INFO L226 Difference]: Without dead ends: 0 [2024-11-07 16:20:37,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=190, Invalid=1447, Unknown=3, NotChecked=0, Total=1640 [2024-11-07 16:20:37,606 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:20:37,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 181 Invalid, 2 Unknown, 0 Unchecked, 3.2s Time] [2024-11-07 16:20:37,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-07 16:20:37,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-07 16:20:37,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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:20:37,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-07 16:20:37,607 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2024-11-07 16:20:37,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:20:37,607 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 16:20:37,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.4) internal successors, (42), 31 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:20:37,607 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-07 16:20:37,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-07 16:20:37,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 7 remaining) [2024-11-07 16:20:37,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 7 remaining) [2024-11-07 16:20:37,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 7 remaining) [2024-11-07 16:20:37,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 7 remaining) [2024-11-07 16:20:37,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2024-11-07 16:20:37,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 7 remaining) [2024-11-07 16:20:37,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-07 16:20:37,628 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:20:37,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:20:37,815 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:20:37,816 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 16:20:37,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:20:37 BoogieIcfgContainer [2024-11-07 16:20:37,820 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 16:20:37,820 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 16:20:37,820 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 16:20:37,821 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 16:20:37,821 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:20:17" (3/4) ... [2024-11-07 16:20:37,823 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 16:20:37,831 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-07 16:20:37,832 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-07 16:20:37,832 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-07 16:20:37,832 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 16:20:37,898 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 16:20:37,899 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 16:20:37,899 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 16:20:37,900 INFO L158 Benchmark]: Toolchain (without parser) took 21364.34ms. Allocated memory was 100.7MB in the beginning and 151.0MB in the end (delta: 50.3MB). Free memory was 76.2MB in the beginning and 67.0MB in the end (delta: 9.3MB). Peak memory consumption was 57.4MB. Max. memory is 16.1GB. [2024-11-07 16:20:37,901 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 16:20:37,901 INFO L158 Benchmark]: CACSL2BoogieTranslator took 347.33ms. Allocated memory is still 100.7MB. Free memory was 76.1MB in the beginning and 60.0MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 16:20:37,901 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.87ms. Allocated memory is still 100.7MB. Free memory was 59.9MB in the beginning and 58.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 16:20:37,901 INFO L158 Benchmark]: Boogie Preprocessor took 31.23ms. Allocated memory is still 100.7MB. Free memory was 58.5MB in the beginning and 56.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 16:20:37,902 INFO L158 Benchmark]: RCFGBuilder took 268.06ms. Allocated memory is still 100.7MB. Free memory was 56.9MB in the beginning and 45.2MB in the end (delta: 11.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 16:20:37,902 INFO L158 Benchmark]: TraceAbstraction took 20607.62ms. Allocated memory was 100.7MB in the beginning and 151.0MB in the end (delta: 50.3MB). Free memory was 44.5MB in the beginning and 72.9MB in the end (delta: -28.4MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. [2024-11-07 16:20:37,904 INFO L158 Benchmark]: Witness Printer took 78.76ms. Allocated memory is still 151.0MB. Free memory was 71.4MB in the beginning and 67.0MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 16:20:37,906 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 347.33ms. Allocated memory is still 100.7MB. Free memory was 76.1MB in the beginning and 60.0MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.87ms. Allocated memory is still 100.7MB. Free memory was 59.9MB in the beginning and 58.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.23ms. Allocated memory is still 100.7MB. Free memory was 58.5MB in the beginning and 56.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 268.06ms. Allocated memory is still 100.7MB. Free memory was 56.9MB in the beginning and 45.2MB in the end (delta: 11.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 20607.62ms. Allocated memory was 100.7MB in the beginning and 151.0MB in the end (delta: 50.3MB). Free memory was 44.5MB in the beginning and 72.9MB in the end (delta: -28.4MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. * Witness Printer took 78.76ms. Allocated memory is still 151.0MB. Free memory was 71.4MB in the beginning and 67.0MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 20.6s, OverallIterations: 16, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 39 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39 mSDsluCounter, 811 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 590 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 966 IncrementalHoareTripleChecker+Invalid, 987 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 221 mSDtfsCounter, 966 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 203 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 696 ImplicationChecksByTransitivity, 11.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=13, InterpolantAutomatonStates: 111, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 25 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 10.7s InterpolantComputationTime, 206 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 228 ConstructedInterpolants, 15 QuantifiedInterpolants, 2615 SizeOfPredicates, 19 NumberOfNonLiveVariables, 406 ConjunctsInSsa, 146 ConjunctsInUnsatCore, 22 InterpolantComputations, 13 PerfectInterpolantSequences, 4/43 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-07 16:20:37,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE