./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-dietlibc/strlcat.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-dietlibc/strlcat.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', '4a2b4697f5c3b66d485090307ef74ec11d08954b2ae38adb1c0f438a86221c12'] 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-dietlibc/strlcat.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 4a2b4697f5c3b66d485090307ef74ec11d08954b2ae38adb1c0f438a86221c12 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 16:19:16,646 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 16:19:16,715 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:19:16,719 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 16:19:16,719 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 16:19:16,743 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 16:19:16,746 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 16:19:16,746 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 16:19:16,747 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 16:19:16,747 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 16:19:16,747 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 16:19:16,747 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 16:19:16,748 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 16:19:16,748 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 16:19:16,749 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 16:19:16,749 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 16:19:16,749 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 16:19:16,749 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 16:19:16,749 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 16:19:16,749 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 16:19:16,749 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 16:19:16,749 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 16:19:16,749 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 16:19:16,749 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 16:19:16,750 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 16:19:16,750 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 16:19:16,750 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 16:19:16,750 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 16:19:16,750 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 16:19:16,750 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 16:19:16,750 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:19:16,751 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 16:19:16,751 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 16:19:16,751 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 16:19:16,751 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 16:19:16,751 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 16:19:16,751 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 16:19:16,751 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 16:19:16,752 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 16:19:16,752 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 -> 4a2b4697f5c3b66d485090307ef74ec11d08954b2ae38adb1c0f438a86221c12 [2024-11-07 16:19:17,012 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 16:19:17,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 16:19:17,020 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 16:19:17,021 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 16:19:17,021 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 16:19:17,022 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-dietlibc/strlcat.i [2024-11-07 16:19:18,247 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 16:19:18,511 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 16:19:18,512 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strlcat.i [2024-11-07 16:19:18,524 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c35401661/16f47d2a2d35470fba4890f1a8f47707/FLAG0034db595 [2024-11-07 16:19:18,538 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c35401661/16f47d2a2d35470fba4890f1a8f47707 [2024-11-07 16:19:18,540 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 16:19:18,543 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 16:19:18,545 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 16:19:18,546 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 16:19:18,552 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 16:19:18,553 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:19:18" (1/1) ... [2024-11-07 16:19:18,554 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25edb7cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:19:18, skipping insertion in model container [2024-11-07 16:19:18,554 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:19:18" (1/1) ... [2024-11-07 16:19:18,579 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 16:19:18,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:19:18,769 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 16:19:18,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:19:18,819 INFO L204 MainTranslator]: Completed translation [2024-11-07 16:19:18,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:19:18 WrapperNode [2024-11-07 16:19:18,820 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 16:19:18,821 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 16:19:18,821 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 16:19:18,821 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 16:19:18,825 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:19:18" (1/1) ... [2024-11-07 16:19:18,833 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:19:18" (1/1) ... [2024-11-07 16:19:18,850 INFO L138 Inliner]: procedures = 114, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 114 [2024-11-07 16:19:18,851 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 16:19:18,852 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 16:19:18,852 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 16:19:18,853 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 16:19:18,858 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:19:18" (1/1) ... [2024-11-07 16:19:18,858 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:19:18" (1/1) ... [2024-11-07 16:19:18,863 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:19:18" (1/1) ... [2024-11-07 16:19:18,884 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [4, 4]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [1, 3]. [2024-11-07 16:19:18,884 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:19:18" (1/1) ... [2024-11-07 16:19:18,884 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:19:18" (1/1) ... [2024-11-07 16:19:18,891 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:19:18" (1/1) ... [2024-11-07 16:19:18,899 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:19:18" (1/1) ... [2024-11-07 16:19:18,900 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:19:18" (1/1) ... [2024-11-07 16:19:18,901 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:19:18" (1/1) ... [2024-11-07 16:19:18,905 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 16:19:18,907 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 16:19:18,907 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 16:19:18,907 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 16:19:18,908 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:19:18" (1/1) ... [2024-11-07 16:19:18,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:19:18,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:19:18,952 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:19:18,954 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:19:18,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 16:19:18,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 16:19:18,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 16:19:18,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 16:19:18,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-07 16:19:18,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 16:19:18,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 16:19:18,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 16:19:19,032 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 16:19:19,033 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 16:19:19,200 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2024-11-07 16:19:19,200 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 16:19:19,209 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 16:19:19,210 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-07 16:19:19,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:19:19 BoogieIcfgContainer [2024-11-07 16:19:19,211 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 16:19:19,213 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 16:19:19,213 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 16:19:19,216 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 16:19:19,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:19:18" (1/3) ... [2024-11-07 16:19:19,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6929ce4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:19:19, skipping insertion in model container [2024-11-07 16:19:19,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:19:18" (2/3) ... [2024-11-07 16:19:19,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6929ce4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:19:19, skipping insertion in model container [2024-11-07 16:19:19,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:19:19" (3/3) ... [2024-11-07 16:19:19,218 INFO L112 eAbstractionObserver]: Analyzing ICFG strlcat.i [2024-11-07 16:19:19,228 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 16:19:19,228 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2024-11-07 16:19:19,253 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 16:19:19,263 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;@e9b6d76, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 16:19:19,264 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2024-11-07 16:19:19,268 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 32 states have (on average 1.90625) internal successors, (61), 49 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:19,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-07 16:19:19,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:19:19,273 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-07 16:19:19,273 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-07 16:19:19,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:19:19,278 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2024-11-07 16:19:19,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:19:19,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175655635] [2024-11-07 16:19:19,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:19:19,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:19:19,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:19:19,382 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:19:19,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:19:19,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175655635] [2024-11-07 16:19:19,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175655635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:19:19,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:19:19,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:19:19,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247126832] [2024-11-07 16:19:19,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:19:19,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:19:19,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:19:19,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:19:19,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:19:19,411 INFO L87 Difference]: Start difference. First operand has 50 states, 32 states have (on average 1.90625) internal successors, (61), 49 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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:19:19,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:19:19,464 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2024-11-07 16:19:19,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:19:19,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2024-11-07 16:19:19,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:19:19,475 INFO L225 Difference]: With dead ends: 51 [2024-11-07 16:19:19,475 INFO L226 Difference]: Without dead ends: 48 [2024-11-07 16:19:19,476 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:19:19,480 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:19:19,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:19:19,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-07 16:19:19,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-07 16:19:19,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 47 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:19,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2024-11-07 16:19:19,534 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 4 [2024-11-07 16:19:19,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:19:19,535 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2024-11-07 16:19:19,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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:19:19,535 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2024-11-07 16:19:19,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-07 16:19:19,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:19:19,535 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-07 16:19:19,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 16:19:19,536 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-07 16:19:19,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:19:19,537 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2024-11-07 16:19:19,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:19:19,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277062365] [2024-11-07 16:19:19,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:19:19,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:19:19,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:19:19,606 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:19:19,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:19:19,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277062365] [2024-11-07 16:19:19,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277062365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:19:19,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:19:19,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:19:19,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423862325] [2024-11-07 16:19:19,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:19:19,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:19:19,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:19:19,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:19:19,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:19:19,608 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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:19:19,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:19:19,641 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2024-11-07 16:19:19,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:19:19,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2024-11-07 16:19:19,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:19:19,642 INFO L225 Difference]: With dead ends: 47 [2024-11-07 16:19:19,642 INFO L226 Difference]: Without dead ends: 47 [2024-11-07 16:19:19,643 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:19:19,644 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 5 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:19:19,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 75 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:19:19,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-07 16:19:19,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-07 16:19:19,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 46 states have internal predecessors, (54), 0 states have call successors, (0), 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:19:19,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2024-11-07 16:19:19,648 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 4 [2024-11-07 16:19:19,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:19:19,648 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2024-11-07 16:19:19,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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:19:19,649 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2024-11-07 16:19:19,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-07 16:19:19,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:19:19,649 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-07 16:19:19,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 16:19:19,649 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-07 16:19:19,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:19:19,650 INFO L85 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2024-11-07 16:19:19,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:19:19,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536440115] [2024-11-07 16:19:19,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:19:19,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:19:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:19:19,755 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:19:19,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:19:19,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536440115] [2024-11-07 16:19:19,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536440115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:19:19,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:19:19,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:19:19,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542611143] [2024-11-07 16:19:19,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:19:19,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:19:19,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:19:19,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:19:19,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:19:19,757 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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:19:19,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:19:19,794 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2024-11-07 16:19:19,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:19:19,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2024-11-07 16:19:19,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:19:19,795 INFO L225 Difference]: With dead ends: 46 [2024-11-07 16:19:19,795 INFO L226 Difference]: Without dead ends: 46 [2024-11-07 16:19:19,795 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:19:19,796 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:19:19,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:19:19,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-07 16:19:19,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-07 16:19:19,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 45 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:19,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2024-11-07 16:19:19,798 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 4 [2024-11-07 16:19:19,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:19:19,798 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2024-11-07 16:19:19,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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:19:19,799 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2024-11-07 16:19:19,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-07 16:19:19,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:19:19,799 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:19:19,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 16:19:19,799 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-07 16:19:19,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:19:19,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1806782697, now seen corresponding path program 1 times [2024-11-07 16:19:19,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:19:19,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142901608] [2024-11-07 16:19:19,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:19:19,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:19:19,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:19:19,839 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:19:19,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:19:19,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142901608] [2024-11-07 16:19:19,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142901608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:19:19,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:19:19,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:19:19,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833743568] [2024-11-07 16:19:19,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:19:19,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:19:19,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:19:19,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:19:19,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:19:19,840 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:19,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:19:19,866 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2024-11-07 16:19:19,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:19:19,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-07 16:19:19,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:19:19,867 INFO L225 Difference]: With dead ends: 45 [2024-11-07 16:19:19,867 INFO L226 Difference]: Without dead ends: 45 [2024-11-07 16:19:19,867 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:19:19,868 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 1 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:19:19,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 78 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:19:19,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-07 16:19:19,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-07 16:19:19,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.6774193548387097) internal successors, (52), 44 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:19,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2024-11-07 16:19:19,871 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 7 [2024-11-07 16:19:19,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:19:19,872 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2024-11-07 16:19:19,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:19,872 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2024-11-07 16:19:19,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-07 16:19:19,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:19:19,873 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:19:19,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 16:19:19,873 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-07 16:19:19,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:19:19,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1806782698, now seen corresponding path program 1 times [2024-11-07 16:19:19,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:19:19,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870753909] [2024-11-07 16:19:19,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:19:19,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:19:19,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:19:19,972 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:19:19,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:19:19,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870753909] [2024-11-07 16:19:19,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870753909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:19:19,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:19:19,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:19:19,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225914503] [2024-11-07 16:19:19,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:19:19,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:19:19,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:19:19,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:19:19,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:19:19,974 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:20,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:19:20,002 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2024-11-07 16:19:20,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:19:20,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-07 16:19:20,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:19:20,003 INFO L225 Difference]: With dead ends: 44 [2024-11-07 16:19:20,003 INFO L226 Difference]: Without dead ends: 44 [2024-11-07 16:19:20,003 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:19:20,004 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 1 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:19:20,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 123 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:19:20,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-07 16:19:20,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-07 16:19:20,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 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:19:20,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2024-11-07 16:19:20,007 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 7 [2024-11-07 16:19:20,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:19:20,007 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2024-11-07 16:19:20,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:20,007 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2024-11-07 16:19:20,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-07 16:19:20,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:19:20,007 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:19:20,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 16:19:20,008 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-07 16:19:20,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:19:20,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1806782726, now seen corresponding path program 1 times [2024-11-07 16:19:20,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:19:20,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835404333] [2024-11-07 16:19:20,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:19:20,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:19:20,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:19:20,087 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:19:20,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:19:20,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835404333] [2024-11-07 16:19:20,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835404333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:19:20,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:19:20,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:19:20,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444507151] [2024-11-07 16:19:20,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:19:20,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:19:20,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:19:20,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:19:20,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:19:20,089 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:20,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:19:20,121 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2024-11-07 16:19:20,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:19:20,121 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-07 16:19:20,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:19:20,122 INFO L225 Difference]: With dead ends: 45 [2024-11-07 16:19:20,122 INFO L226 Difference]: Without dead ends: 44 [2024-11-07 16:19:20,122 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:19:20,123 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:19:20,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:19:20,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-07 16:19:20,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-07 16:19:20,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 43 states have internal predecessors, (50), 0 states have call successors, (0), 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:19:20,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2024-11-07 16:19:20,125 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 7 [2024-11-07 16:19:20,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:19:20,125 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2024-11-07 16:19:20,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:20,125 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2024-11-07 16:19:20,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-07 16:19:20,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:19:20,126 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:19:20,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 16:19:20,126 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-07 16:19:20,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:19:20,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1151383918, now seen corresponding path program 1 times [2024-11-07 16:19:20,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:19:20,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187667265] [2024-11-07 16:19:20,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:19:20,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:19:20,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:19:20,207 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:19:20,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:19:20,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187667265] [2024-11-07 16:19:20,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187667265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:19:20,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:19:20,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:19:20,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472957909] [2024-11-07 16:19:20,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:19:20,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:19:20,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:19:20,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:19:20,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:19:20,208 INFO L87 Difference]: Start difference. First operand 44 states and 50 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:19:20,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:19:20,244 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2024-11-07 16:19:20,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:19:20,244 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:19:20,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:19:20,245 INFO L225 Difference]: With dead ends: 43 [2024-11-07 16:19:20,245 INFO L226 Difference]: Without dead ends: 43 [2024-11-07 16:19:20,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:19:20,245 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 32 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:19:20,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 55 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:19:20,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-07 16:19:20,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2024-11-07 16:19:20,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 41 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:20,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2024-11-07 16:19:20,248 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 9 [2024-11-07 16:19:20,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:19:20,248 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2024-11-07 16:19:20,248 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:19:20,248 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2024-11-07 16:19:20,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-07 16:19:20,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:19:20,249 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:19:20,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 16:19:20,249 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-07 16:19:20,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:19:20,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1151383919, now seen corresponding path program 1 times [2024-11-07 16:19:20,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:19:20,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405112369] [2024-11-07 16:19:20,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:19:20,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:19:20,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:19:20,398 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:19:20,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:19:20,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405112369] [2024-11-07 16:19:20,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405112369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:19:20,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:19:20,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:19:20,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950095050] [2024-11-07 16:19:20,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:19:20,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:19:20,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:19:20,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:19:20,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:19:20,399 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 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:19:20,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:19:20,469 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2024-11-07 16:19:20,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:19:20,469 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 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:19:20,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:19:20,471 INFO L225 Difference]: With dead ends: 64 [2024-11-07 16:19:20,471 INFO L226 Difference]: Without dead ends: 64 [2024-11-07 16:19:20,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:19:20,471 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 26 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:19:20,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 134 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:19:20,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-07 16:19:20,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2024-11-07 16:19:20,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 52 states have internal predecessors, (66), 0 states have call successors, (0), 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:19:20,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2024-11-07 16:19:20,474 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 9 [2024-11-07 16:19:20,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:19:20,474 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2024-11-07 16:19:20,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 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:19:20,475 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2024-11-07 16:19:20,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-07 16:19:20,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:19:20,476 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:19:20,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 16:19:20,476 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-07 16:19:20,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:19:20,477 INFO L85 PathProgramCache]: Analyzing trace with hash 698971654, now seen corresponding path program 1 times [2024-11-07 16:19:20,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:19:20,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661271987] [2024-11-07 16:19:20,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:19:20,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:19:20,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:19:20,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:19:20,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:19:20,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661271987] [2024-11-07 16:19:20,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661271987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:19:20,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:19:20,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:19:20,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611245721] [2024-11-07 16:19:20,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:19:20,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:19:20,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:19:20,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:19:20,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:19:20,513 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:20,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:19:20,522 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2024-11-07 16:19:20,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:19:20,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-07 16:19:20,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:19:20,525 INFO L225 Difference]: With dead ends: 55 [2024-11-07 16:19:20,525 INFO L226 Difference]: Without dead ends: 55 [2024-11-07 16:19:20,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:19:20,526 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:19:20,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:19:20,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-07 16:19:20,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-07 16:19:20,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 44 states have (on average 1.5454545454545454) internal successors, (68), 54 states have internal predecessors, (68), 0 states have call successors, (0), 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:19:20,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2024-11-07 16:19:20,528 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 13 [2024-11-07 16:19:20,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:19:20,528 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2024-11-07 16:19:20,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:20,528 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2024-11-07 16:19:20,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-07 16:19:20,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:19:20,529 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:19:20,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 16:19:20,529 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-07 16:19:20,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:19:20,529 INFO L85 PathProgramCache]: Analyzing trace with hash 698969732, now seen corresponding path program 1 times [2024-11-07 16:19:20,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:19:20,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391719288] [2024-11-07 16:19:20,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:19:20,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:19:20,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:19:20,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:19:20,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:19:20,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391719288] [2024-11-07 16:19:20,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391719288] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:19:20,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107170244] [2024-11-07 16:19:20,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:19:20,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:19:20,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:19:20,944 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:19:20,949 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:19:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:19:21,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-07 16:19:21,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:19:21,058 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:19:21,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:19:21,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-07 16:19:21,139 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:19:21,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-07 16:19:21,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:19:21,230 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 18 treesize of output 19 [2024-11-07 16:19:21,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:19:21,353 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:19:21,718 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:19:21,725 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:19:21,728 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 15 treesize of output 11 [2024-11-07 16:19:21,735 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-07 16:19:21,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2024-11-07 16:19:21,745 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 22 treesize of output 20 [2024-11-07 16:19:21,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:19:21,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107170244] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:19:21,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:19:21,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2024-11-07 16:19:21,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926462051] [2024-11-07 16:19:21,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:19:21,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-07 16:19:21,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:19:21,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-07 16:19:21,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2024-11-07 16:19:21,761 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:22,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:19:22,323 INFO L93 Difference]: Finished difference Result 122 states and 149 transitions. [2024-11-07 16:19:22,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 16:19:22,323 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-07 16:19:22,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:19:22,326 INFO L225 Difference]: With dead ends: 122 [2024-11-07 16:19:22,326 INFO L226 Difference]: Without dead ends: 122 [2024-11-07 16:19:22,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2024-11-07 16:19:22,327 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 338 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:19:22,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 617 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 16:19:22,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-07 16:19:22,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 62. [2024-11-07 16:19:22,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 61 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:22,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 83 transitions. [2024-11-07 16:19:22,332 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 83 transitions. Word has length 13 [2024-11-07 16:19:22,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:19:22,332 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 83 transitions. [2024-11-07 16:19:22,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:22,332 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 83 transitions. [2024-11-07 16:19:22,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-07 16:19:22,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:19:22,332 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:19:22,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 16:19:22,539 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,SelfDestructingSolverStorable9 [2024-11-07 16:19:22,540 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-07 16:19:22,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:19:22,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1696819422, now seen corresponding path program 1 times [2024-11-07 16:19:22,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:19:22,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947654280] [2024-11-07 16:19:22,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:19:22,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:19:22,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:19:22,606 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:19:22,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:19:22,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947654280] [2024-11-07 16:19:22,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947654280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:19:22,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:19:22,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:19:22,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862893505] [2024-11-07 16:19:22,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:19:22,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:19:22,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:19:22,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:19:22,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:19:22,607 INFO L87 Difference]: Start difference. First operand 62 states and 83 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:22,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:19:22,637 INFO L93 Difference]: Finished difference Result 61 states and 79 transitions. [2024-11-07 16:19:22,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:19:22,638 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-07 16:19:22,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:19:22,638 INFO L225 Difference]: With dead ends: 61 [2024-11-07 16:19:22,638 INFO L226 Difference]: Without dead ends: 61 [2024-11-07 16:19:22,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:19:22,639 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 16 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:19:22,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 68 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:19:22,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-07 16:19:22,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2024-11-07 16:19:22,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 51 states have (on average 1.5294117647058822) internal successors, (78), 59 states have internal predecessors, (78), 0 states have call successors, (0), 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:19:22,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 78 transitions. [2024-11-07 16:19:22,641 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 78 transitions. Word has length 15 [2024-11-07 16:19:22,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:19:22,641 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 78 transitions. [2024-11-07 16:19:22,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:22,642 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 78 transitions. [2024-11-07 16:19:22,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-07 16:19:22,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:19:22,642 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:19:22,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 16:19:22,642 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-07 16:19:22,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:19:22,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1696819423, now seen corresponding path program 1 times [2024-11-07 16:19:22,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:19:22,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934535071] [2024-11-07 16:19:22,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:19:22,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:19:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:19:22,769 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:19:22,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:19:22,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934535071] [2024-11-07 16:19:22,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934535071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:19:22,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:19:22,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:19:22,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237577328] [2024-11-07 16:19:22,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:19:22,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:19:22,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:19:22,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:19:22,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:19:22,770 INFO L87 Difference]: Start difference. First operand 60 states and 78 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:22,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:19:22,817 INFO L93 Difference]: Finished difference Result 79 states and 103 transitions. [2024-11-07 16:19:22,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:19:22,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-07 16:19:22,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:19:22,818 INFO L225 Difference]: With dead ends: 79 [2024-11-07 16:19:22,818 INFO L226 Difference]: Without dead ends: 79 [2024-11-07 16:19:22,819 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:19:22,819 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 15 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:19:22,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 108 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:19:22,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-07 16:19:22,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 68. [2024-11-07 16:19:22,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 59 states have (on average 1.5254237288135593) internal successors, (90), 67 states have internal predecessors, (90), 0 states have call successors, (0), 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:19:22,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 90 transitions. [2024-11-07 16:19:22,821 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 90 transitions. Word has length 15 [2024-11-07 16:19:22,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:19:22,822 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 90 transitions. [2024-11-07 16:19:22,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:22,822 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 90 transitions. [2024-11-07 16:19:22,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-07 16:19:22,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:19:22,822 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:19:22,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 16:19:22,822 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-07 16:19:22,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:19:22,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1061768763, now seen corresponding path program 1 times [2024-11-07 16:19:22,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:19:22,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934895540] [2024-11-07 16:19:22,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:19:22,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:19:22,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:19:22,862 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:19:22,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:19:22,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934895540] [2024-11-07 16:19:22,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934895540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:19:22,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:19:22,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:19:22,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77857262] [2024-11-07 16:19:22,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:19:22,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:19:22,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:19:22,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:19:22,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:19:22,864 INFO L87 Difference]: Start difference. First operand 68 states and 90 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:22,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:19:22,909 INFO L93 Difference]: Finished difference Result 69 states and 91 transitions. [2024-11-07 16:19:22,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:19:22,909 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-07 16:19:22,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:19:22,910 INFO L225 Difference]: With dead ends: 69 [2024-11-07 16:19:22,910 INFO L226 Difference]: Without dead ends: 69 [2024-11-07 16:19:22,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:19:22,910 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 21 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:19:22,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 74 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:19:22,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-07 16:19:22,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2024-11-07 16:19:22,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 59 states have (on average 1.5084745762711864) internal successors, (89), 66 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:22,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 89 transitions. [2024-11-07 16:19:22,913 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 89 transitions. Word has length 16 [2024-11-07 16:19:22,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:19:22,913 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 89 transitions. [2024-11-07 16:19:22,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:22,913 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 89 transitions. [2024-11-07 16:19:22,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-07 16:19:22,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:19:22,913 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:19:22,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 16:19:22,913 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-07 16:19:22,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:19:22,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1061768764, now seen corresponding path program 1 times [2024-11-07 16:19:22,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:19:22,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156735709] [2024-11-07 16:19:22,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:19:22,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:19:22,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:19:23,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:19:23,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:19:23,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156735709] [2024-11-07 16:19:23,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156735709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:19:23,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:19:23,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:19:23,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145705730] [2024-11-07 16:19:23,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:19:23,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:19:23,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:19:23,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:19:23,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:19:23,028 INFO L87 Difference]: Start difference. First operand 67 states and 89 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:23,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:19:23,090 INFO L93 Difference]: Finished difference Result 83 states and 108 transitions. [2024-11-07 16:19:23,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:19:23,090 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-07 16:19:23,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:19:23,091 INFO L225 Difference]: With dead ends: 83 [2024-11-07 16:19:23,091 INFO L226 Difference]: Without dead ends: 83 [2024-11-07 16:19:23,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:19:23,091 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 20 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:19:23,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 115 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:19:23,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-07 16:19:23,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 68. [2024-11-07 16:19:23,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 60 states have (on average 1.5) internal successors, (90), 67 states have internal predecessors, (90), 0 states have call successors, (0), 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:19:23,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 90 transitions. [2024-11-07 16:19:23,094 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 90 transitions. Word has length 16 [2024-11-07 16:19:23,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:19:23,094 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 90 transitions. [2024-11-07 16:19:23,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:23,094 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 90 transitions. [2024-11-07 16:19:23,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-07 16:19:23,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:19:23,094 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:19:23,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 16:19:23,095 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-07 16:19:23,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:19:23,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1115132185, now seen corresponding path program 2 times [2024-11-07 16:19:23,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:19:23,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009626517] [2024-11-07 16:19:23,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:19:23,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:19:23,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:19:23,605 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:19:23,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:19:23,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009626517] [2024-11-07 16:19:23,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009626517] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:19:23,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207996110] [2024-11-07 16:19:23,606 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:19:23,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:19:23,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:19:23,608 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:19:23,609 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:19:23,688 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 16:19:23,689 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:19:23,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-07 16:19:23,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:19:23,721 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:19:23,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:19:23,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-07 16:19:23,782 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:19:23,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-07 16:19:24,087 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2024-11-07 16:19:24,088 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 28 treesize of output 23 [2024-11-07 16:19:24,189 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:19:24,190 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:19:24,636 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 49 treesize of output 45 [2024-11-07 16:19:24,671 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:19:24,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 64 [2024-11-07 16:19:24,723 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:19:24,728 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:19:24,763 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:19:24,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207996110] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:19:24,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:19:24,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 32 [2024-11-07 16:19:24,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931139774] [2024-11-07 16:19:24,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:19:24,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-07 16:19:24,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:19:24,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-07 16:19:24,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=932, Unknown=0, NotChecked=0, Total=1056 [2024-11-07 16:19:24,765 INFO L87 Difference]: Start difference. First operand 68 states and 90 transitions. Second operand has 33 states, 32 states have (on average 1.40625) internal successors, (45), 33 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:27,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 16:19:29,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:19:29,472 INFO L93 Difference]: Finished difference Result 193 states and 246 transitions. [2024-11-07 16:19:29,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-07 16:19:29,473 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.40625) internal successors, (45), 33 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-07 16:19:29,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:19:29,474 INFO L225 Difference]: With dead ends: 193 [2024-11-07 16:19:29,474 INFO L226 Difference]: Without dead ends: 193 [2024-11-07 16:19:29,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=302, Invalid=1860, Unknown=0, NotChecked=0, Total=2162 [2024-11-07 16:19:29,475 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 487 mSDsluCounter, 1258 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 11 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 1359 SdHoareTripleChecker+Invalid, 1313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:19:29,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 1359 Invalid, 1313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1296 Invalid, 6 Unknown, 0 Unchecked, 4.2s Time] [2024-11-07 16:19:29,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-07 16:19:29,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 62. [2024-11-07 16:19:29,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 55 states have (on average 1.490909090909091) internal successors, (82), 61 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:29,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 82 transitions. [2024-11-07 16:19:29,481 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 82 transitions. Word has length 17 [2024-11-07 16:19:29,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:19:29,481 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 82 transitions. [2024-11-07 16:19:29,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.40625) internal successors, (45), 33 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:29,482 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 82 transitions. [2024-11-07 16:19:29,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-07 16:19:29,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:19:29,482 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:19:29,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 16:19:29,682 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:19:29,683 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-07 16:19:29,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:19:29,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1842477907, now seen corresponding path program 1 times [2024-11-07 16:19:29,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:19:29,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366341230] [2024-11-07 16:19:29,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:19:29,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:19:29,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:19:29,750 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:19:29,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:19:29,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366341230] [2024-11-07 16:19:29,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366341230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:19:29,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:19:29,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:19:29,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253995793] [2024-11-07 16:19:29,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:19:29,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:19:29,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:19:29,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:19:29,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:19:29,752 INFO L87 Difference]: Start difference. First operand 62 states and 82 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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:19:29,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:19:29,773 INFO L93 Difference]: Finished difference Result 63 states and 82 transitions. [2024-11-07 16:19:29,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:19:29,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-07 16:19:29,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:19:29,774 INFO L225 Difference]: With dead ends: 63 [2024-11-07 16:19:29,774 INFO L226 Difference]: Without dead ends: 63 [2024-11-07 16:19:29,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:19:29,774 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 21 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:19:29,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 98 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:19:29,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-07 16:19:29,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2024-11-07 16:19:29,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 61 states have internal predecessors, (81), 0 states have call successors, (0), 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:19:29,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 81 transitions. [2024-11-07 16:19:29,776 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 81 transitions. Word has length 18 [2024-11-07 16:19:29,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:19:29,776 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 81 transitions. [2024-11-07 16:19:29,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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:19:29,777 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 81 transitions. [2024-11-07 16:19:29,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-07 16:19:29,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:19:29,777 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:19:29,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 16:19:29,777 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-07 16:19:29,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:19:29,777 INFO L85 PathProgramCache]: Analyzing trace with hash -511617514, now seen corresponding path program 1 times [2024-11-07 16:19:29,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:19:29,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676550505] [2024-11-07 16:19:29,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:19:29,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:19:29,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:19:29,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:19:29,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:19:29,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676550505] [2024-11-07 16:19:29,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676550505] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:19:29,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394675992] [2024-11-07 16:19:29,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:19:29,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:19:29,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:19:29,982 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:19:29,983 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:19:30,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:19:30,039 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-07 16:19:30,040 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:19:30,052 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:19:30,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:19:30,185 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 18 treesize of output 19 [2024-11-07 16:19:30,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:19:30,233 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:19:30,369 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:19:30,373 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 22 treesize of output 20 [2024-11-07 16:19:30,377 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:19:30,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:19:30,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394675992] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:19:30,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:19:30,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2024-11-07 16:19:30,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145588326] [2024-11-07 16:19:30,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:19:30,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-07 16:19:30,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:19:30,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-07 16:19:30,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2024-11-07 16:19:30,389 INFO L87 Difference]: Start difference. First operand 62 states and 81 transitions. Second operand has 18 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:30,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:19:30,583 INFO L93 Difference]: Finished difference Result 96 states and 124 transitions. [2024-11-07 16:19:30,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 16:19:30,584 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-07 16:19:30,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:19:30,584 INFO L225 Difference]: With dead ends: 96 [2024-11-07 16:19:30,584 INFO L226 Difference]: Without dead ends: 96 [2024-11-07 16:19:30,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2024-11-07 16:19:30,585 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 57 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:19:30,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 211 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:19:30,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-07 16:19:30,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2024-11-07 16:19:30,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 65 states have (on average 1.4307692307692308) internal successors, (93), 70 states have internal predecessors, (93), 0 states have call successors, (0), 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:19:30,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 93 transitions. [2024-11-07 16:19:30,587 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 93 transitions. Word has length 19 [2024-11-07 16:19:30,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:19:30,587 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 93 transitions. [2024-11-07 16:19:30,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:30,587 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 93 transitions. [2024-11-07 16:19:30,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-07 16:19:30,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:19:30,587 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:19:30,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-07 16:19:30,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:19:30,788 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-07 16:19:30,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:19:30,789 INFO L85 PathProgramCache]: Analyzing trace with hash -511626460, now seen corresponding path program 1 times [2024-11-07 16:19:30,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:19:30,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764361740] [2024-11-07 16:19:30,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:19:30,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:19:30,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:19:30,819 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:19:30,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:19:30,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764361740] [2024-11-07 16:19:30,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764361740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:19:30,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:19:30,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:19:30,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266589652] [2024-11-07 16:19:30,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:19:30,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:19:30,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:19:30,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:19:30,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:19:30,820 INFO L87 Difference]: Start difference. First operand 71 states and 93 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:30,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:19:30,854 INFO L93 Difference]: Finished difference Result 72 states and 91 transitions. [2024-11-07 16:19:30,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:19:30,854 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-07 16:19:30,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:19:30,854 INFO L225 Difference]: With dead ends: 72 [2024-11-07 16:19:30,854 INFO L226 Difference]: Without dead ends: 72 [2024-11-07 16:19:30,855 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:19:30,855 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 18 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:19:30,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 55 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:19:30,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-07 16:19:30,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2024-11-07 16:19:30,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 69 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:30,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2024-11-07 16:19:30,857 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 19 [2024-11-07 16:19:30,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:19:30,857 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2024-11-07 16:19:30,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:30,857 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2024-11-07 16:19:30,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-07 16:19:30,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:19:30,859 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:19:30,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 16:19:30,859 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-07 16:19:30,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:19:30,859 INFO L85 PathProgramCache]: Analyzing trace with hash -511626459, now seen corresponding path program 1 times [2024-11-07 16:19:30,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:19:30,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493523960] [2024-11-07 16:19:30,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:19:30,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:19:30,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:19:30,934 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:19:30,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:19:30,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493523960] [2024-11-07 16:19:30,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493523960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:19:30,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:19:30,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:19:30,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46839530] [2024-11-07 16:19:30,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:19:30,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:19:30,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:19:30,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:19:30,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:19:30,936 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:30,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:19:30,968 INFO L93 Difference]: Finished difference Result 116 states and 149 transitions. [2024-11-07 16:19:30,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:19:30,968 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-07 16:19:30,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:19:30,968 INFO L225 Difference]: With dead ends: 116 [2024-11-07 16:19:30,968 INFO L226 Difference]: Without dead ends: 116 [2024-11-07 16:19:30,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:19:30,969 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 28 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:19:30,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 104 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:19:30,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-07 16:19:30,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 105. [2024-11-07 16:19:30,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 100 states have (on average 1.38) internal successors, (138), 104 states have internal predecessors, (138), 0 states have call successors, (0), 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:19:30,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 138 transitions. [2024-11-07 16:19:30,971 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 138 transitions. Word has length 19 [2024-11-07 16:19:30,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:19:30,971 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 138 transitions. [2024-11-07 16:19:30,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:30,971 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 138 transitions. [2024-11-07 16:19:30,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-07 16:19:30,972 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:19:30,972 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:19:30,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 16:19:30,972 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-07 16:19:30,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:19:30,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1280884675, now seen corresponding path program 1 times [2024-11-07 16:19:30,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:19:30,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483790836] [2024-11-07 16:19:30,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:19:30,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:19:30,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:19:31,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:19:31,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:19:31,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483790836] [2024-11-07 16:19:31,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483790836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:19:31,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:19:31,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 16:19:31,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453374037] [2024-11-07 16:19:31,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:19:31,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 16:19:31,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:19:31,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 16:19:31,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:19:31,067 INFO L87 Difference]: Start difference. First operand 105 states and 138 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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:19:31,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:19:31,116 INFO L93 Difference]: Finished difference Result 113 states and 143 transitions. [2024-11-07 16:19:31,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:19:31,116 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-07 16:19:31,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:19:31,116 INFO L225 Difference]: With dead ends: 113 [2024-11-07 16:19:31,117 INFO L226 Difference]: Without dead ends: 113 [2024-11-07 16:19:31,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:19:31,118 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 17 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:19:31,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 136 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:19:31,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-07 16:19:31,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 105. [2024-11-07 16:19:31,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 100 states have (on average 1.36) internal successors, (136), 104 states have internal predecessors, (136), 0 states have call successors, (0), 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:19:31,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 136 transitions. [2024-11-07 16:19:31,120 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 136 transitions. Word has length 19 [2024-11-07 16:19:31,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:19:31,120 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 136 transitions. [2024-11-07 16:19:31,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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:19:31,121 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 136 transitions. [2024-11-07 16:19:31,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-07 16:19:31,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:19:31,123 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:19:31,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 16:19:31,123 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-07 16:19:31,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:19:31,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1318065658, now seen corresponding path program 1 times [2024-11-07 16:19:31,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:19:31,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410874302] [2024-11-07 16:19:31,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:19:31,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:19:31,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:19:31,298 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:19:31,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:19:31,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410874302] [2024-11-07 16:19:31,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410874302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:19:31,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:19:31,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:19:31,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689807185] [2024-11-07 16:19:31,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:19:31,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:19:31,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:19:31,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:19:31,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:19:31,300 INFO L87 Difference]: Start difference. First operand 105 states and 136 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 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:19:31,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:19:31,337 INFO L93 Difference]: Finished difference Result 104 states and 135 transitions. [2024-11-07 16:19:31,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:19:31,337 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-07 16:19:31,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:19:31,338 INFO L225 Difference]: With dead ends: 104 [2024-11-07 16:19:31,338 INFO L226 Difference]: Without dead ends: 98 [2024-11-07 16:19:31,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:19:31,338 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 21 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:19:31,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 82 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:19:31,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-07 16:19:31,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-07 16:19:31,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 94 states have (on average 1.2765957446808511) internal successors, (120), 97 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:31,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 120 transitions. [2024-11-07 16:19:31,340 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 120 transitions. Word has length 20 [2024-11-07 16:19:31,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:19:31,340 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 120 transitions. [2024-11-07 16:19:31,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 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:19:31,340 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 120 transitions. [2024-11-07 16:19:31,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-07 16:19:31,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:19:31,341 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:19:31,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 16:19:31,341 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-07 16:19:31,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:19:31,341 INFO L85 PathProgramCache]: Analyzing trace with hash -165163059, now seen corresponding path program 2 times [2024-11-07 16:19:31,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:19:31,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047090643] [2024-11-07 16:19:31,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:19:31,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:19:31,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:19:31,673 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:19:31,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:19:31,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047090643] [2024-11-07 16:19:31,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047090643] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:19:31,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138980686] [2024-11-07 16:19:31,674 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:19:31,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:19:31,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:19:31,677 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:19:31,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-07 16:19:31,744 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 16:19:31,745 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:19:31,746 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-07 16:19:31,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:19:31,755 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:19:31,873 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:19:31,875 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:19:32,023 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:19:32,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138980686] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 16:19:32,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:19:32,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 7] total 21 [2024-11-07 16:19:32,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661454857] [2024-11-07 16:19:32,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:19:32,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 16:19:32,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:19:32,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 16:19:32,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2024-11-07 16:19:32,024 INFO L87 Difference]: Start difference. First operand 98 states and 120 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:32,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:19:32,099 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2024-11-07 16:19:32,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:19:32,102 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-07 16:19:32,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:19:32,102 INFO L225 Difference]: With dead ends: 88 [2024-11-07 16:19:32,102 INFO L226 Difference]: Without dead ends: 84 [2024-11-07 16:19:32,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2024-11-07 16:19:32,103 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 8 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:19:32,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 60 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:19:32,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-07 16:19:32,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2024-11-07 16:19:32,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 78 states have (on average 1.2564102564102564) internal successors, (98), 81 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:32,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 98 transitions. [2024-11-07 16:19:32,108 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 98 transitions. Word has length 23 [2024-11-07 16:19:32,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:19:32,108 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 98 transitions. [2024-11-07 16:19:32,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:32,108 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 98 transitions. [2024-11-07 16:19:32,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-07 16:19:32,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:19:32,109 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:19:32,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-07 16:19:32,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-07 16:19:32,310 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-07 16:19:32,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:19:32,310 INFO L85 PathProgramCache]: Analyzing trace with hash 95310330, now seen corresponding path program 1 times [2024-11-07 16:19:32,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:19:32,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401409102] [2024-11-07 16:19:32,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:19:32,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:19:32,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:19:32,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:19:32,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:19:32,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401409102] [2024-11-07 16:19:32,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401409102] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:19:32,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211873141] [2024-11-07 16:19:32,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:19:32,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:19:32,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:19:32,387 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:19:32,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-07 16:19:32,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:19:32,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-07 16:19:32,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:19:32,492 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:19:32,492 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:19:32,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211873141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:19:32,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 16:19:32,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-11-07 16:19:32,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909302378] [2024-11-07 16:19:32,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:19:32,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:19:32,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:19:32,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:19:32,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:19:32,494 INFO L87 Difference]: Start difference. First operand 82 states and 98 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:32,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:19:32,534 INFO L93 Difference]: Finished difference Result 91 states and 105 transitions. [2024-11-07 16:19:32,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:19:32,534 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-07 16:19:32,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:19:32,535 INFO L225 Difference]: With dead ends: 91 [2024-11-07 16:19:32,535 INFO L226 Difference]: Without dead ends: 91 [2024-11-07 16:19:32,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:19:32,535 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 49 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:19:32,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 77 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:19:32,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-07 16:19:32,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2024-11-07 16:19:32,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 82 states have (on average 1.2317073170731707) internal successors, (101), 85 states have internal predecessors, (101), 0 states have call successors, (0), 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:19:32,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 101 transitions. [2024-11-07 16:19:32,538 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 101 transitions. Word has length 23 [2024-11-07 16:19:32,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:19:32,539 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 101 transitions. [2024-11-07 16:19:32,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:32,539 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 101 transitions. [2024-11-07 16:19:32,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-07 16:19:32,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:19:32,539 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:19:32,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-07 16:19:32,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-07 16:19:32,744 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-07 16:19:32,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:19:32,744 INFO L85 PathProgramCache]: Analyzing trace with hash -673947886, now seen corresponding path program 1 times [2024-11-07 16:19:32,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:19:32,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238704406] [2024-11-07 16:19:32,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:19:32,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:19:32,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:19:32,951 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 16:19:32,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:19:32,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238704406] [2024-11-07 16:19:32,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238704406] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:19:32,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115944611] [2024-11-07 16:19:32,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:19:32,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:19:32,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:19:32,954 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:19:32,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-07 16:19:33,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:19:33,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-07 16:19:33,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:19:33,029 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:19:33,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:19:33,175 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 18 treesize of output 19 [2024-11-07 16:19:33,228 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 16:19:33,228 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:19:33,467 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:19:33,473 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 22 treesize of output 20 [2024-11-07 16:19:33,480 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 5 treesize of output 3 [2024-11-07 16:19:33,487 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 16:19:33,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115944611] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:19:33,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:19:33,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2024-11-07 16:19:33,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100258731] [2024-11-07 16:19:33,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:19:33,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-07 16:19:33,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:19:33,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-07 16:19:33,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2024-11-07 16:19:33,488 INFO L87 Difference]: Start difference. First operand 86 states and 101 transitions. Second operand has 21 states, 20 states have (on average 2.55) internal successors, (51), 21 states have internal predecessors, (51), 0 states have call successors, (0), 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:19:33,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:19:33,744 INFO L93 Difference]: Finished difference Result 91 states and 106 transitions. [2024-11-07 16:19:33,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 16:19:33,744 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.55) internal successors, (51), 21 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-07 16:19:33,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:19:33,745 INFO L225 Difference]: With dead ends: 91 [2024-11-07 16:19:33,745 INFO L226 Difference]: Without dead ends: 91 [2024-11-07 16:19:33,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2024-11-07 16:19:33,745 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 23 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:19:33,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 214 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:19:33,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-07 16:19:33,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2024-11-07 16:19:33,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 85 states have (on average 1.223529411764706) internal successors, (104), 88 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:19:33,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 104 transitions. [2024-11-07 16:19:33,748 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 104 transitions. Word has length 23 [2024-11-07 16:19:33,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:19:33,748 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 104 transitions. [2024-11-07 16:19:33,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.55) internal successors, (51), 21 states have internal predecessors, (51), 0 states have call successors, (0), 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:19:33,748 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 104 transitions. [2024-11-07 16:19:33,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-07 16:19:33,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:19:33,748 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:19:33,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-07 16:19:33,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-07 16:19:33,953 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-07 16:19:33,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:19:33,953 INFO L85 PathProgramCache]: Analyzing trace with hash 794469340, now seen corresponding path program 1 times [2024-11-07 16:19:33,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:19:33,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315687762] [2024-11-07 16:19:33,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:19:33,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:19:33,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 16:19:33,963 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 16:19:33,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 16:19:33,982 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 16:19:33,983 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 16:19:33,983 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 17 remaining) [2024-11-07 16:19:33,989 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 17 remaining) [2024-11-07 16:19:33,989 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 17 remaining) [2024-11-07 16:19:33,989 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 17 remaining) [2024-11-07 16:19:33,989 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 17 remaining) [2024-11-07 16:19:33,989 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 17 remaining) [2024-11-07 16:19:33,989 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 17 remaining) [2024-11-07 16:19:33,989 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 17 remaining) [2024-11-07 16:19:33,989 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 17 remaining) [2024-11-07 16:19:33,989 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 17 remaining) [2024-11-07 16:19:33,989 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 17 remaining) [2024-11-07 16:19:33,989 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 17 remaining) [2024-11-07 16:19:33,989 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 17 remaining) [2024-11-07 16:19:33,989 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 17 remaining) [2024-11-07 16:19:33,989 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 17 remaining) [2024-11-07 16:19:33,989 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 17 remaining) [2024-11-07 16:19:33,989 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (0 of 17 remaining) [2024-11-07 16:19:33,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-07 16:19:33,991 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:19:34,025 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 16:19:34,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:19:34 BoogieIcfgContainer [2024-11-07 16:19:34,031 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 16:19:34,032 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 16:19:34,032 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 16:19:34,032 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 16:19:34,033 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:19:19" (3/4) ... [2024-11-07 16:19:34,033 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-07 16:19:34,082 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 16:19:34,083 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 16:19:34,083 INFO L158 Benchmark]: Toolchain (without parser) took 15540.93ms. Allocated memory was 117.4MB in the beginning and 218.1MB in the end (delta: 100.7MB). Free memory was 92.2MB in the beginning and 120.8MB in the end (delta: -28.6MB). Peak memory consumption was 74.1MB. Max. memory is 16.1GB. [2024-11-07 16:19:34,083 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 83.9MB. Free memory is still 48.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 16:19:34,083 INFO L158 Benchmark]: CACSL2BoogieTranslator took 274.85ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 75.4MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 16:19:34,084 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.45ms. Allocated memory is still 117.4MB. Free memory was 75.4MB in the beginning and 73.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 16:19:34,084 INFO L158 Benchmark]: Boogie Preprocessor took 54.17ms. Allocated memory is still 117.4MB. Free memory was 73.6MB in the beginning and 71.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 16:19:34,084 INFO L158 Benchmark]: RCFGBuilder took 304.78ms. Allocated memory is still 117.4MB. Free memory was 71.8MB in the beginning and 55.5MB in the end (delta: 16.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 16:19:34,084 INFO L158 Benchmark]: TraceAbstraction took 14818.30ms. Allocated memory was 117.4MB in the beginning and 218.1MB in the end (delta: 100.7MB). Free memory was 54.9MB in the beginning and 123.2MB in the end (delta: -68.3MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. [2024-11-07 16:19:34,085 INFO L158 Benchmark]: Witness Printer took 51.04ms. Allocated memory is still 218.1MB. Free memory was 123.2MB in the beginning and 120.8MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 16:19:34,086 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.16ms. Allocated memory is still 83.9MB. Free memory is still 48.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 274.85ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 75.4MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.45ms. Allocated memory is still 117.4MB. Free memory was 75.4MB in the beginning and 73.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 54.17ms. Allocated memory is still 117.4MB. Free memory was 73.6MB in the beginning and 71.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 304.78ms. Allocated memory is still 117.4MB. Free memory was 71.8MB in the beginning and 55.5MB in the end (delta: 16.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 14818.30ms. Allocated memory was 117.4MB in the beginning and 218.1MB in the end (delta: 100.7MB). Free memory was 54.9MB in the beginning and 123.2MB in the end (delta: -68.3MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. * Witness Printer took 51.04ms. Allocated memory is still 218.1MB. Free memory was 123.2MB in the beginning and 120.8MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. 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 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L538] int in_len = __VERIFIER_nondet_int(); [L539] COND FALSE !(in_len < 1) [L540] char* in = __builtin_alloca (in_len); VAL [in={4:0}, in_len=1] [L541] in[in_len-1]=0 [L542] int out_len = __VERIFIER_nondet_int(); [L543] COND FALSE !(out_len < 1) [L544] char* out = __builtin_alloca (out_len); VAL [in={4:0}, out={3:0}, out_len=2] [L545] out[out_len-1]=0 [L546] CALL strlcat(in, out, out_len) [L517] register char *d = dst; [L518] register const char *s = src; [L519] register size_t n = siz; [L520] size_t dlen; VAL [d={4:0}, n=2, s={3:0}, siz=2] [L521] EXPR \read(*d) [L521] *d != '\0' && n-- != 0 VAL [d={4:0}, n=2, s={3:0}, siz=2] [L521] COND FALSE !(*d != '\0' && n-- != 0) [L523] dlen = d - dst [L524] n = siz - dlen VAL [d={4:0}, dlen=0, n=2, s={3:0}] [L525] COND FALSE !(n == 0) [L527] EXPR \read(*s) [L527] COND TRUE *s != '\0' [L528] COND TRUE n != 1 [L529] EXPR d++ VAL [d={4:1}, dlen=0, n=2, s={3:0}] [L529] EXPR \read(*s) [L529] *d++ = *s [L530] n-- VAL [d={4:1}, dlen=0, n=1, s={3:0}] [L532] s++ VAL [d={4:1}, dlen=0, n=1, s={3:1}] [L527] EXPR \read(*s) [L527] COND FALSE !(*s != '\0') [L534] *d = '\0' - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 50 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 14.7s, OverallIterations: 25, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 1204 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1204 mSDsluCounter, 4261 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3293 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3274 IncrementalHoareTripleChecker+Invalid, 3334 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 968 mSDtfsCounter, 3274 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 359 GetRequests, 161 SyntacticMatches, 3 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=19, InterpolantAutomatonStates: 146, 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, 24 MinimizatonAttempts, 288 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 481 NumberOfCodeBlocks, 481 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 517 ConstructedInterpolants, 53 QuantifiedInterpolants, 5224 SizeOfPredicates, 40 NumberOfNonLiveVariables, 800 ConjunctsInSsa, 205 ConjunctsInUnsatCore, 35 InterpolantComputations, 20 PerfectInterpolantSequences, 30/67 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-07 16:19:34,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)