./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/AutomizerReach.xml', '-i', '../sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '5a7a61549e909154c33d5cf68876338c8745b83dde5aedff258c17f34600afc7'] 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/AutomizerReach.xml -i ../sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5a7a61549e909154c33d5cf68876338c8745b83dde5aedff258c17f34600afc7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 23:55:46,942 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 23:55:47,023 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 23:55:47,030 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 23:55:47,032 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 23:55:47,062 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 23:55:47,064 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 23:55:47,064 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 23:55:47,065 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 23:55:47,065 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 23:55:47,065 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 23:55:47,065 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 23:55:47,065 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 23:55:47,065 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 23:55:47,065 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 23:55:47,065 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 23:55:47,066 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 23:55:47,066 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 23:55:47,066 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 23:55:47,066 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 23:55:47,066 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 23:55:47,066 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 23:55:47,066 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 23:55:47,068 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 23:55:47,068 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 23:55:47,068 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 23:55:47,068 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 23:55:47,068 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 23:55:47,068 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 23:55:47,068 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 23:55:47,068 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 23:55:47,068 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 23:55:47,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 23:55:47,069 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 23:55:47,069 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 23:55:47,069 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 23:55:47,069 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 23:55:47,069 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 23:55:47,069 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 23:55:47,069 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 23:55:47,069 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 23:55:47,069 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 23:55:47,069 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5a7a61549e909154c33d5cf68876338c8745b83dde5aedff258c17f34600afc7 [2024-11-06 23:55:47,330 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 23:55:47,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 23:55:47,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 23:55:47,346 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 23:55:47,346 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 23:55:47,348 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c [2024-11-06 23:55:48,629 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 23:55:48,830 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 23:55:48,831 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c [2024-11-06 23:55:48,837 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e67e87cd/33fcbece53a64407b232efdbcad08ead/FLAG7c32ded06 [2024-11-06 23:55:49,187 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e67e87cd/33fcbece53a64407b232efdbcad08ead [2024-11-06 23:55:49,189 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 23:55:49,190 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 23:55:49,192 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 23:55:49,192 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 23:55:49,195 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 23:55:49,195 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:55:49" (1/1) ... [2024-11-06 23:55:49,196 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@435a36cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:55:49, skipping insertion in model container [2024-11-06 23:55:49,196 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:55:49" (1/1) ... [2024-11-06 23:55:49,209 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 23:55:49,323 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c[618,631] [2024-11-06 23:55:49,335 WARN L1674 CHandler]: Possible shadowing of function min [2024-11-06 23:55:49,337 WARN L1674 CHandler]: Possible shadowing of function min [2024-11-06 23:55:49,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 23:55:49,361 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 23:55:49,370 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c[618,631] [2024-11-06 23:55:49,374 WARN L1674 CHandler]: Possible shadowing of function min [2024-11-06 23:55:49,375 WARN L1674 CHandler]: Possible shadowing of function min [2024-11-06 23:55:49,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 23:55:49,398 INFO L204 MainTranslator]: Completed translation [2024-11-06 23:55:49,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:55:49 WrapperNode [2024-11-06 23:55:49,400 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 23:55:49,401 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 23:55:49,401 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 23:55:49,401 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 23:55:49,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:55:49" (1/1) ... [2024-11-06 23:55:49,416 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:55:49" (1/1) ... [2024-11-06 23:55:49,436 INFO L138 Inliner]: procedures = 29, calls = 58, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 68 [2024-11-06 23:55:49,438 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 23:55:49,438 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 23:55:49,438 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 23:55:49,439 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 23:55:49,447 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:55:49" (1/1) ... [2024-11-06 23:55:49,448 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:55:49" (1/1) ... [2024-11-06 23:55:49,455 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:55:49" (1/1) ... [2024-11-06 23:55:49,489 INFO L175 MemorySlicer]: Split 24 memory accesses to 4 slices as follows [2, 15, 2, 5]. 63 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 7 writes are split as follows [0, 4, 1, 2]. [2024-11-06 23:55:49,490 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:55:49" (1/1) ... [2024-11-06 23:55:49,490 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:55:49" (1/1) ... [2024-11-06 23:55:49,509 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:55:49" (1/1) ... [2024-11-06 23:55:49,512 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:55:49" (1/1) ... [2024-11-06 23:55:49,518 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:55:49" (1/1) ... [2024-11-06 23:55:49,519 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:55:49" (1/1) ... [2024-11-06 23:55:49,522 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 23:55:49,526 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 23:55:49,527 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 23:55:49,527 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 23:55:49,527 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:55:49" (1/1) ... [2024-11-06 23:55:49,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 23:55:49,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 23:55:49,558 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-06 23:55:49,565 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-06 23:55:49,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 23:55:49,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-06 23:55:49,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-06 23:55:49,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-06 23:55:49,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-06 23:55:49,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-06 23:55:49,588 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2024-11-06 23:55:49,588 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2024-11-06 23:55:49,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-06 23:55:49,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-06 23:55:49,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-06 23:55:49,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-06 23:55:49,588 INFO L130 BoogieDeclarations]: Found specification of procedure min [2024-11-06 23:55:49,588 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2024-11-06 23:55:49,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-06 23:55:49,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-06 23:55:49,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-06 23:55:49,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-06 23:55:49,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-11-06 23:55:49,590 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-11-06 23:55:49,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-06 23:55:49,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-06 23:55:49,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-06 23:55:49,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-06 23:55:49,591 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2024-11-06 23:55:49,591 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2024-11-06 23:55:49,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 23:55:49,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-06 23:55:49,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-06 23:55:49,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-06 23:55:49,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-06 23:55:49,592 INFO L130 BoogieDeclarations]: Found specification of procedure size [2024-11-06 23:55:49,593 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2024-11-06 23:55:49,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 23:55:49,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 23:55:49,593 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-06 23:55:49,593 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-06 23:55:49,593 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2024-11-06 23:55:49,593 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2024-11-06 23:55:49,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-06 23:55:49,758 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 23:55:49,760 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 23:55:50,111 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2024-11-06 23:55:50,112 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 23:55:50,126 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 23:55:50,128 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 23:55:50,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:55:50 BoogieIcfgContainer [2024-11-06 23:55:50,128 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 23:55:50,131 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 23:55:50,131 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 23:55:50,134 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 23:55:50,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:55:49" (1/3) ... [2024-11-06 23:55:50,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@119a6cb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:55:50, skipping insertion in model container [2024-11-06 23:55:50,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:55:49" (2/3) ... [2024-11-06 23:55:50,136 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@119a6cb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:55:50, skipping insertion in model container [2024-11-06 23:55:50,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:55:50" (3/3) ... [2024-11-06 23:55:50,137 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_del_rec_incorrect.c [2024-11-06 23:55:50,150 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 23:55:50,150 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 23:55:50,202 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 23:55:50,213 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=LoopHeads, 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;@3e940be1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 23:55:50,214 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 23:55:50,217 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 54 states have internal predecessors, (64), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-06 23:55:50,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-06 23:55:50,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:55:50,226 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:55:50,226 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:55:50,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:55:50,232 INFO L85 PathProgramCache]: Analyzing trace with hash 2090481852, now seen corresponding path program 1 times [2024-11-06 23:55:50,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:55:50,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989364221] [2024-11-06 23:55:50,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:55:50,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:55:50,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:55:50,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 23:55:50,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:55:50,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-06 23:55:50,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:55:50,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-06 23:55:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:55:50,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-06 23:55:50,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:55:50,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-06 23:55:50,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:55:50,565 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-06 23:55:50,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:55:50,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989364221] [2024-11-06 23:55:50,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989364221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:55:50,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:55:50,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 23:55:50,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347621789] [2024-11-06 23:55:50,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:55:50,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 23:55:50,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:55:50,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 23:55:50,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 23:55:50,593 INFO L87 Difference]: Start difference. First operand has 84 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 54 states have internal predecessors, (64), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:55:50,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:55:50,980 INFO L93 Difference]: Finished difference Result 147 states and 195 transitions. [2024-11-06 23:55:50,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 23:55:50,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2024-11-06 23:55:50,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:55:50,989 INFO L225 Difference]: With dead ends: 147 [2024-11-06 23:55:50,989 INFO L226 Difference]: Without dead ends: 84 [2024-11-06 23:55:50,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:55:50,994 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 107 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 23:55:50,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 88 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 23:55:51,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-06 23:55:51,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 79. [2024-11-06 23:55:51,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 49 states have internal predecessors, (56), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-06 23:55:51,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 100 transitions. [2024-11-06 23:55:51,046 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 100 transitions. Word has length 37 [2024-11-06 23:55:51,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:55:51,047 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 100 transitions. [2024-11-06 23:55:51,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:55:51,047 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 100 transitions. [2024-11-06 23:55:51,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-06 23:55:51,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:55:51,051 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:55:51,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 23:55:51,051 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:55:51,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:55:51,052 INFO L85 PathProgramCache]: Analyzing trace with hash 502133950, now seen corresponding path program 1 times [2024-11-06 23:55:51,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:55:51,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925760240] [2024-11-06 23:55:51,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:55:51,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:55:51,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:55:51,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 23:55:51,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:55:51,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-06 23:55:51,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:55:51,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-06 23:55:51,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:55:51,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-06 23:55:51,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:55:51,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-06 23:55:51,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:55:51,463 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-06 23:55:51,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:55:51,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925760240] [2024-11-06 23:55:51,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925760240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:55:51,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:55:51,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-06 23:55:51,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694592595] [2024-11-06 23:55:51,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:55:51,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 23:55:51,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:55:51,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 23:55:51,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-06 23:55:51,467 INFO L87 Difference]: Start difference. First operand 79 states and 100 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:55:51,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:55:51,941 INFO L93 Difference]: Finished difference Result 141 states and 183 transitions. [2024-11-06 23:55:51,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 23:55:51,941 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2024-11-06 23:55:51,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:55:51,943 INFO L225 Difference]: With dead ends: 141 [2024-11-06 23:55:51,944 INFO L226 Difference]: Without dead ends: 86 [2024-11-06 23:55:51,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-06 23:55:51,945 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 74 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 23:55:51,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 171 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 23:55:51,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-06 23:55:51,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2024-11-06 23:55:51,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 50 states have (on average 1.14) internal successors, (57), 51 states have internal predecessors, (57), 22 states have call successors, (22), 7 states have call predecessors, (22), 8 states have return successors, (25), 22 states have call predecessors, (25), 22 states have call successors, (25) [2024-11-06 23:55:51,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 104 transitions. [2024-11-06 23:55:51,961 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 104 transitions. Word has length 37 [2024-11-06 23:55:51,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:55:51,962 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 104 transitions. [2024-11-06 23:55:51,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:55:51,962 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 104 transitions. [2024-11-06 23:55:51,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-06 23:55:51,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:55:51,963 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:55:51,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 23:55:51,963 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:55:51,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:55:51,964 INFO L85 PathProgramCache]: Analyzing trace with hash 807671323, now seen corresponding path program 1 times [2024-11-06 23:55:51,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:55:51,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073047866] [2024-11-06 23:55:51,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:55:51,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:55:51,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:55:52,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 23:55:52,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:55:52,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-06 23:55:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:55:52,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-06 23:55:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:55:52,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 23:55:52,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:55:52,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-06 23:55:52,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:55:52,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-06 23:55:52,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:55:52,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-06 23:55:52,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:55:52,411 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-06 23:55:52,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:55:52,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073047866] [2024-11-06 23:55:52,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073047866] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 23:55:52,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965852149] [2024-11-06 23:55:52,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:55:52,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 23:55:52,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 23:55:52,415 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-06 23:55:52,416 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-06 23:55:52,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:55:52,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-06 23:55:52,554 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 23:55:52,701 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-06 23:55:52,701 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 23:55:52,905 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-06 23:55:52,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965852149] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 23:55:52,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 23:55:52,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 13 [2024-11-06 23:55:52,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998044991] [2024-11-06 23:55:52,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 23:55:52,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-06 23:55:52,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:55:52,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-06 23:55:52,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-06 23:55:52,909 INFO L87 Difference]: Start difference. First operand 81 states and 104 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 9 states have internal predecessors, (44), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-06 23:55:53,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:55:53,519 INFO L93 Difference]: Finished difference Result 147 states and 192 transitions. [2024-11-06 23:55:53,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-06 23:55:53,520 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 9 states have internal predecessors, (44), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 49 [2024-11-06 23:55:53,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:55:53,521 INFO L225 Difference]: With dead ends: 147 [2024-11-06 23:55:53,521 INFO L226 Difference]: Without dead ends: 86 [2024-11-06 23:55:53,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2024-11-06 23:55:53,523 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 109 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 23:55:53,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 215 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 23:55:53,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-06 23:55:53,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2024-11-06 23:55:53,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 53 states have internal predecessors, (58), 22 states have call successors, (22), 7 states have call predecessors, (22), 9 states have return successors, (27), 22 states have call predecessors, (27), 22 states have call successors, (27) [2024-11-06 23:55:53,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 107 transitions. [2024-11-06 23:55:53,535 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 107 transitions. Word has length 49 [2024-11-06 23:55:53,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:55:53,536 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 107 transitions. [2024-11-06 23:55:53,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 9 states have internal predecessors, (44), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-06 23:55:53,536 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 107 transitions. [2024-11-06 23:55:53,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-06 23:55:53,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:55:53,537 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:55:53,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-06 23:55:53,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 23:55:53,742 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:55:53,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:55:53,742 INFO L85 PathProgramCache]: Analyzing trace with hash -2093045024, now seen corresponding path program 1 times [2024-11-06 23:55:53,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:55:53,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496660469] [2024-11-06 23:55:53,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:55:53,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:55:53,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:55:53,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 23:55:53,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:55:54,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 23:55:54,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:55:54,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-06 23:55:54,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:55:54,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 23:55:54,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:55:54,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-06 23:55:54,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:55:54,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 23:55:54,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:55:54,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-06 23:55:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:55:54,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-06 23:55:54,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:55:54,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-06 23:55:54,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:55:54,109 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-06 23:55:54,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:55:54,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496660469] [2024-11-06 23:55:54,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496660469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:55:54,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:55:54,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-06 23:55:54,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393113712] [2024-11-06 23:55:54,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:55:54,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-06 23:55:54,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:55:54,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-06 23:55:54,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-06 23:55:54,111 INFO L87 Difference]: Start difference. First operand 83 states and 107 transitions. Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-06 23:55:54,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:55:54,605 INFO L93 Difference]: Finished difference Result 147 states and 192 transitions. [2024-11-06 23:55:54,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-06 23:55:54,606 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 61 [2024-11-06 23:55:54,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:55:54,607 INFO L225 Difference]: With dead ends: 147 [2024-11-06 23:55:54,608 INFO L226 Difference]: Without dead ends: 88 [2024-11-06 23:55:54,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-06 23:55:54,611 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 88 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 23:55:54,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 248 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 23:55:54,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-06 23:55:54,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2024-11-06 23:55:54,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 55 states have internal predecessors, (59), 22 states have call successors, (22), 7 states have call predecessors, (22), 10 states have return successors, (29), 22 states have call predecessors, (29), 22 states have call successors, (29) [2024-11-06 23:55:54,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 110 transitions. [2024-11-06 23:55:54,632 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 110 transitions. Word has length 61 [2024-11-06 23:55:54,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:55:54,633 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 110 transitions. [2024-11-06 23:55:54,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-06 23:55:54,633 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 110 transitions. [2024-11-06 23:55:54,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-06 23:55:54,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:55:54,634 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:55:54,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 23:55:54,634 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:55:54,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:55:54,635 INFO L85 PathProgramCache]: Analyzing trace with hash -727185622, now seen corresponding path program 1 times [2024-11-06 23:55:54,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:55:54,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299395865] [2024-11-06 23:55:54,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:55:54,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:55:54,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:55:54,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 23:55:54,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:55:54,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 23:55:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:55:54,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-06 23:55:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:55:54,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 23:55:54,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:55:55,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 23:55:55,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:55:55,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-06 23:55:55,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:55:55,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-06 23:55:55,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:55:55,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 23:55:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:55:55,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-06 23:55:55,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:55:55,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-06 23:55:55,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:55:55,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-06 23:55:55,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:55:55,161 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-06 23:55:55,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:55:55,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299395865] [2024-11-06 23:55:55,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299395865] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 23:55:55,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837982571] [2024-11-06 23:55:55,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:55:55,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 23:55:55,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 23:55:55,167 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-06 23:55:55,170 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-06 23:55:55,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:55:55,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-06 23:55:55,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 23:55:55,391 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-06 23:55:55,391 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 23:55:55,608 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-06 23:55:55,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837982571] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 23:55:55,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 23:55:55,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 17 [2024-11-06 23:55:55,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669194147] [2024-11-06 23:55:55,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 23:55:55,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-06 23:55:55,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:55:55,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-06 23:55:55,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2024-11-06 23:55:55,610 INFO L87 Difference]: Start difference. First operand 85 states and 110 transitions. Second operand has 17 states, 16 states have (on average 3.0) internal successors, (48), 13 states have internal predecessors, (48), 7 states have call successors, (18), 5 states have call predecessors, (18), 4 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-06 23:55:56,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:55:56,364 INFO L93 Difference]: Finished difference Result 139 states and 180 transitions. [2024-11-06 23:55:56,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-06 23:55:56,365 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.0) internal successors, (48), 13 states have internal predecessors, (48), 7 states have call successors, (18), 5 states have call predecessors, (18), 4 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) Word has length 74 [2024-11-06 23:55:56,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:55:56,366 INFO L225 Difference]: With dead ends: 139 [2024-11-06 23:55:56,368 INFO L226 Difference]: Without dead ends: 88 [2024-11-06 23:55:56,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=641, Unknown=0, NotChecked=0, Total=756 [2024-11-06 23:55:56,370 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 99 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 23:55:56,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 319 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 23:55:56,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-06 23:55:56,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2024-11-06 23:55:56,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 57 states have internal predecessors, (60), 22 states have call successors, (22), 7 states have call predecessors, (22), 11 states have return successors, (31), 22 states have call predecessors, (31), 22 states have call successors, (31) [2024-11-06 23:55:56,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 113 transitions. [2024-11-06 23:55:56,383 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 113 transitions. Word has length 74 [2024-11-06 23:55:56,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:55:56,383 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 113 transitions. [2024-11-06 23:55:56,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.0) internal successors, (48), 13 states have internal predecessors, (48), 7 states have call successors, (18), 5 states have call predecessors, (18), 4 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-06 23:55:56,383 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 113 transitions. [2024-11-06 23:55:56,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-06 23:55:56,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:55:56,385 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:55:56,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-06 23:55:56,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 23:55:56,589 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:55:56,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:55:56,589 INFO L85 PathProgramCache]: Analyzing trace with hash 982794621, now seen corresponding path program 1 times [2024-11-06 23:55:56,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:55:56,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825962265] [2024-11-06 23:55:56,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:55:56,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:55:56,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 23:55:56,627 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-06 23:55:56,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 23:55:56,697 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-06 23:55:56,697 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-06 23:55:56,698 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 23:55:56,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 23:55:56,703 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-06 23:55:56,732 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 23:55:56,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:55:56 BoogieIcfgContainer [2024-11-06 23:55:56,734 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 23:55:56,735 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 23:55:56,735 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 23:55:56,735 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 23:55:56,735 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:55:50" (3/4) ... [2024-11-06 23:55:56,736 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-06 23:55:56,786 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 23:55:56,787 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 23:55:56,788 INFO L158 Benchmark]: Toolchain (without parser) took 7597.02ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 91.9MB in the beginning and 114.4MB in the end (delta: -22.5MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2024-11-06 23:55:56,789 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 117.4MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 23:55:56,789 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.64ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 79.3MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 23:55:56,789 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.21ms. Allocated memory is still 117.4MB. Free memory was 79.3MB in the beginning and 78.0MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 23:55:56,790 INFO L158 Benchmark]: Boogie Preprocessor took 83.61ms. Allocated memory is still 117.4MB. Free memory was 78.0MB in the beginning and 75.2MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 23:55:56,790 INFO L158 Benchmark]: RCFGBuilder took 602.03ms. Allocated memory is still 117.4MB. Free memory was 75.2MB in the beginning and 54.3MB in the end (delta: 20.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-06 23:55:56,790 INFO L158 Benchmark]: TraceAbstraction took 6603.68ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 53.8MB in the beginning and 119.2MB in the end (delta: -65.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 23:55:56,790 INFO L158 Benchmark]: Witness Printer took 52.09ms. Allocated memory is still 159.4MB. Free memory was 117.6MB in the beginning and 114.4MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 23:55:56,791 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.26ms. Allocated memory is still 117.4MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 208.64ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 79.3MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.21ms. Allocated memory is still 117.4MB. Free memory was 79.3MB in the beginning and 78.0MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.61ms. Allocated memory is still 117.4MB. Free memory was 78.0MB in the beginning and 75.2MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 602.03ms. Allocated memory is still 117.4MB. Free memory was 75.2MB in the beginning and 54.3MB in the end (delta: 20.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6603.68ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 53.8MB in the beginning and 119.2MB in the end (delta: -65.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 52.09ms. Allocated memory is still 159.4MB. Free memory was 117.6MB in the beginning and 114.4MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L98] CALL, EXPR nondet_tree() [L25] COND FALSE !(__VERIFIER_nondet_bool()) [L28] struct node *n = (struct node *)malloc(sizeof(struct node)); [L29] n->data = __VERIFIER_nondet_int() [L30] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; VAL [\result={0:0}] [L30] RET, EXPR nondet_tree() VAL [n={-1:0}] [L30] n->left = nondet_tree() [L31] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; VAL [\result={0:0}] [L31] RET, EXPR nondet_tree() VAL [n={-1:0}] [L31] n->right = nondet_tree() [L32] return n; VAL [\result={-1:0}] [L98] RET, EXPR nondet_tree() [L98] CALL task(nondet_tree()) [L76] CALL, EXPR min(t) VAL [\old(n)={-1:0}] [L37] COND FALSE !(!n) [L40] EXPR n->left VAL [\old(n)={-1:0}, n={-1:0}] [L40] CALL, EXPR min(n->left) VAL [\old(n)={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\old(n)={0:0}, \result=2147483647] [L40] RET, EXPR min(n->left) VAL [\old(n)={-1:0}, n={-1:0}] [L40] int a = min(n->left); [L41] EXPR n->right VAL [\old(n)={-1:0}, a=2147483647] [L41] CALL, EXPR min(n->right) VAL [\old(n)={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\old(n)={0:0}, \result=2147483647] [L41] RET, EXPR min(n->right) VAL [\old(n)={-1:0}, a=2147483647] [L41] int b = min(n->right); [L42] COND TRUE a <= b [L42] return a; VAL [\old(n)={-1:0}, \result=2147483647] [L76] RET, EXPR min(t) VAL [t={-1:0}] [L76] int a = min(t); [L77] int b; VAL [a=2147483647, b={5:0}, t={-1:0}] [L79] CALL, EXPR size(t) VAL [\old(t)={-1:0}] [L71] COND FALSE !(!t) [L72] EXPR t->left VAL [\old(t)={-1:0}, t={-1:0}] [L72] CALL, EXPR size(t->left) VAL [\old(t)={0:0}] [L71] COND TRUE !t [L71] return 0; VAL [\old(t)={0:0}, \result=0] [L72] RET, EXPR size(t->left) VAL [\old(t)={-1:0}, t={-1:0}] [L72] EXPR t->right VAL [\old(t)={-1:0}] [L72] CALL, EXPR size(t->right) VAL [\old(t)={0:0}] [L71] COND TRUE !t [L71] return 0; VAL [\old(t)={0:0}, \result=0] [L72] RET, EXPR size(t->right) VAL [\old(t)={-1:0}] [L72] return size(t->left) + size(t->right) + 1; [L79] RET, EXPR size(t) VAL [a=2147483647, b={5:0}, t={-1:0}] [L79] int n = size(t); [L80] CALL assume_abort_if_not(n != 0) [L10] COND FALSE !(!cond) [L80] RET assume_abort_if_not(n != 0) [L81] EXPR, FCALL calloc(n, sizeof(int)) VAL [a=2147483647, b={5:0}, n=1, t={-1:0}] [L81] int *x = calloc(n, sizeof(int)); [L82] CALL tree_inorder(t, x, n) VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={-1:0}] [L60] COND FALSE !(!t) [L63] EXPR t->left VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={-1:0}, a={-3:0}, i=1, t={-1:0}] [L63] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={0:0}] [L60] COND TRUE !t [L61] return i; VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={0:0}, \result=1, a={-3:0}] [L63] RET, EXPR tree_inorder(t->left, a, i) VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={-1:0}, a={-3:0}, i=1, t={-1:0}] [L63] i = tree_inorder(t->left, a, i) [L64] EXPR i++ [L64] EXPR t->data [L64] a[i++] = t->data [L65] EXPR t->right VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={-1:0}, a={-3:0}, i=2] [L65] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(a)={-3:0}, \old(i)=2, \old(t)={0:0}] [L60] COND TRUE !t [L61] return i; VAL [\old(a)={-3:0}, \old(i)=2, \old(t)={0:0}, \result=2, a={-3:0}] [L65] RET, EXPR tree_inorder(t->right, a, i) VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={-1:0}, a={-3:0}, i=2] [L65] i = tree_inorder(t->right, a, i) [L66] return i; VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={-1:0}, \result=2, a={-3:0}, i=2] [L82] RET tree_inorder(t, x, n) VAL [a=2147483647, b={5:0}, n=1, t={-1:0}, x={-3:0}] [L83] EXPR x[0] [L83] CALL __VERIFIER_assert(a == x[0]) VAL [\old(cond)=0] [L16] COND TRUE !cond VAL [\old(cond)=0] [L16] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 84 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.5s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 514 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 477 mSDsluCounter, 1041 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 822 mSDsCounter, 376 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2234 IncrementalHoareTripleChecker+Invalid, 2610 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 376 mSolverCounterUnsat, 219 mSDtfsCounter, 2234 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 380 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=5, InterpolantAutomatonStates: 52, 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, 5 MinimizatonAttempts, 17 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 467 NumberOfCodeBlocks, 467 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 495 ConstructedInterpolants, 0 QuantifiedInterpolants, 1378 SizeOfPredicates, 6 NumberOfNonLiveVariables, 631 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 156/168 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-06 23:55:56,817 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