./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/echo-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 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/busybox-1.22.0/echo-1.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 c9ee359f30954fa4d93e8fd6e950c33543e0d3abd082876e3a14e2b9867db5cd --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:05:50,476 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:05:50,554 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-01-10 00:05:50,561 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:05:50,566 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:05:50,596 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:05:50,597 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:05:50,598 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:05:50,598 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:05:50,598 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:05:50,599 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:05:50,599 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:05:50,600 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:05:50,600 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:05:50,600 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:05:50,600 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:05:50,601 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:05:50,601 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:05:50,601 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:05:50,601 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:05:50,601 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:05:50,601 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:05:50,601 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:05:50,602 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:05:50,602 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:05:50,602 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:05:50,602 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:05:50,602 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:05:50,602 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:05:50,602 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:05:50,602 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:05:50,602 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:05:50,603 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:05:50,603 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:05:50,603 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:05:50,603 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:05:50,603 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:05:50,604 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:05:50,604 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:05:50,604 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:05:50,604 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:05:50,604 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:05:50,604 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:05:50,604 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:05:50,604 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 -> c9ee359f30954fa4d93e8fd6e950c33543e0d3abd082876e3a14e2b9867db5cd [2025-01-10 00:05:50,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:05:50,866 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:05:50,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:05:50,869 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:05:50,869 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:05:50,870 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/echo-1.i [2025-01-10 00:05:52,208 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d7bb17b64/e8dc4874f65c4536a32fda79f55e85cb/FLAGe7486b668 [2025-01-10 00:05:52,626 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:05:52,627 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/echo-1.i [2025-01-10 00:05:52,674 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d7bb17b64/e8dc4874f65c4536a32fda79f55e85cb/FLAGe7486b668 [2025-01-10 00:05:52,781 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d7bb17b64/e8dc4874f65c4536a32fda79f55e85cb [2025-01-10 00:05:52,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:05:52,788 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:05:52,789 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:05:52,790 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:05:52,794 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:05:52,795 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:05:52" (1/1) ... [2025-01-10 00:05:52,796 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75da354a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:05:52, skipping insertion in model container [2025-01-10 00:05:52,796 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:05:52" (1/1) ... [2025-01-10 00:05:52,857 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:05:53,720 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:53,723 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:53,743 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:53,744 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:53,745 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:53,746 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:53,746 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:53,747 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:53,747 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:53,751 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:53,753 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:53,756 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:53,762 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:53,768 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:53,769 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:53,770 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:53,779 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:53,780 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:53,780 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:53,786 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:53,787 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:53,795 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:53,808 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:53,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:05:53,855 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:05:53,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:05:54,114 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-01-10 00:05:54,120 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:05:54,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:05:54 WrapperNode [2025-01-10 00:05:54,121 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:05:54,122 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:05:54,122 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:05:54,122 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:05:54,126 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:05:54" (1/1) ... [2025-01-10 00:05:54,153 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:05:54" (1/1) ... [2025-01-10 00:05:54,210 INFO L138 Inliner]: procedures = 599, calls = 554, calls flagged for inlining = 17, calls inlined = 15, statements flattened = 1053 [2025-01-10 00:05:54,210 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:05:54,211 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:05:54,211 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:05:54,211 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:05:54,222 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:05:54" (1/1) ... [2025-01-10 00:05:54,222 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:05:54" (1/1) ... [2025-01-10 00:05:54,244 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:05:54" (1/1) ... [2025-01-10 00:05:54,251 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-10 00:05:54,252 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:05:54" (1/1) ... [2025-01-10 00:05:54,256 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:05:54" (1/1) ... [2025-01-10 00:05:54,301 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:05:54" (1/1) ... [2025-01-10 00:05:54,304 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:05:54" (1/1) ... [2025-01-10 00:05:54,316 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:05:54" (1/1) ... [2025-01-10 00:05:54,330 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:05:54" (1/1) ... [2025-01-10 00:05:54,340 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:05:54" (1/1) ... [2025-01-10 00:05:54,354 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:05:54,355 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:05:54,355 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:05:54,355 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:05:54,359 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:05:54" (1/1) ... [2025-01-10 00:05:54,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:05:54,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:05:54,387 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) [2025-01-10 00:05:54,390 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 [2025-01-10 00:05:54,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 00:05:54,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-01-10 00:05:54,414 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-01-10 00:05:54,414 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-01-10 00:05:54,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-01-10 00:05:54,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-10 00:05:54,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 00:05:54,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:05:54,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-10 00:05:54,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:05:54,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:05:54,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-01-10 00:05:54,414 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-01-10 00:05:54,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-01-10 00:05:54,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-01-10 00:05:54,414 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-10 00:05:54,414 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-10 00:05:54,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 00:05:54,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-01-10 00:05:54,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-01-10 00:05:54,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-10 00:05:54,414 INFO L130 BoogieDeclarations]: Found specification of procedure full_write [2025-01-10 00:05:54,415 INFO L138 BoogieDeclarations]: Found implementation of procedure full_write [2025-01-10 00:05:54,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-10 00:05:54,736 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:05:54,737 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:06:00,041 INFO L? ?]: Removed 477 outVars from TransFormulas that were not future-live. [2025-01-10 00:06:00,042 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:06:00,071 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:06:00,075 INFO L312 CfgBuilder]: Removed 14 assume(true) statements. [2025-01-10 00:06:00,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:06:00 BoogieIcfgContainer [2025-01-10 00:06:00,076 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:06:00,078 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:06:00,078 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:06:00,084 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:06:00,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:05:52" (1/3) ... [2025-01-10 00:06:00,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@246202f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:06:00, skipping insertion in model container [2025-01-10 00:06:00,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:05:54" (2/3) ... [2025-01-10 00:06:00,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@246202f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:06:00, skipping insertion in model container [2025-01-10 00:06:00,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:06:00" (3/3) ... [2025-01-10 00:06:00,087 INFO L128 eAbstractionObserver]: Analyzing ICFG echo-1.i [2025-01-10 00:06:00,102 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:06:00,104 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG echo-1.i that has 5 procedures, 440 locations, 1 initial locations, 19 loop locations, and 175 error locations. [2025-01-10 00:06:00,161 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:06:00,172 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;@4d1603e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:06:00,172 INFO L334 AbstractCegarLoop]: Starting to check reachability of 175 error locations. [2025-01-10 00:06:00,181 INFO L276 IsEmpty]: Start isEmpty. Operand has 440 states, 251 states have (on average 1.9880478087649402) internal successors, (499), 426 states have internal predecessors, (499), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 00:06:00,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-01-10 00:06:00,185 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:06:00,186 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-01-10 00:06:00,187 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2025-01-10 00:06:00,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:06:00,192 INFO L85 PathProgramCache]: Analyzing trace with hash 318820, now seen corresponding path program 1 times [2025-01-10 00:06:00,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:06:00,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669136232] [2025-01-10 00:06:00,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:00,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:06:00,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:06:00,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:06:00,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:00,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:01,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:06:01,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:06:01,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669136232] [2025-01-10 00:06:01,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669136232] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:06:01,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:06:01,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:06:01,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489311839] [2025-01-10 00:06:01,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:06:01,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:06:01,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:06:01,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:06:01,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:06:01,404 INFO L87 Difference]: Start difference. First operand has 440 states, 251 states have (on average 1.9880478087649402) internal successors, (499), 426 states have internal predecessors, (499), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:06:05,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 00:06:05,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:06:05,959 INFO L93 Difference]: Finished difference Result 406 states and 469 transitions. [2025-01-10 00:06:05,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:06:05,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-01-10 00:06:05,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:06:05,978 INFO L225 Difference]: With dead ends: 406 [2025-01-10 00:06:05,978 INFO L226 Difference]: Without dead ends: 404 [2025-01-10 00:06:05,979 INFO L434 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 [2025-01-10 00:06:05,982 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 223 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-01-10 00:06:05,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 399 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 170 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2025-01-10 00:06:05,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-01-10 00:06:06,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 291. [2025-01-10 00:06:06,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 174 states have (on average 1.8563218390804597) internal successors, (323), 282 states have internal predecessors, (323), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 00:06:06,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 333 transitions. [2025-01-10 00:06:06,043 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 333 transitions. Word has length 3 [2025-01-10 00:06:06,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:06:06,043 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 333 transitions. [2025-01-10 00:06:06,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:06:06,043 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 333 transitions. [2025-01-10 00:06:06,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-01-10 00:06:06,044 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:06:06,044 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-01-10 00:06:06,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:06:06,044 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2025-01-10 00:06:06,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:06:06,045 INFO L85 PathProgramCache]: Analyzing trace with hash 318821, now seen corresponding path program 1 times [2025-01-10 00:06:06,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:06:06,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186413240] [2025-01-10 00:06:06,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:06,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:06:06,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:06:06,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:06:06,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:06,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:06,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:06:06,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:06:06,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186413240] [2025-01-10 00:06:06,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186413240] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:06:06,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:06:06,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:06:06,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409092239] [2025-01-10 00:06:06,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:06:06,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:06:06,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:06:06,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:06:06,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:06:06,818 INFO L87 Difference]: Start difference. First operand 291 states and 333 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:06:10,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 00:06:11,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:06:11,084 INFO L93 Difference]: Finished difference Result 290 states and 332 transitions. [2025-01-10 00:06:11,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:06:11,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-01-10 00:06:11,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:06:11,086 INFO L225 Difference]: With dead ends: 290 [2025-01-10 00:06:11,086 INFO L226 Difference]: Without dead ends: 290 [2025-01-10 00:06:11,086 INFO L434 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 [2025-01-10 00:06:11,087 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 10 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:06:11,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 544 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-01-10 00:06:11,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-01-10 00:06:11,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2025-01-10 00:06:11,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 174 states have (on average 1.8505747126436782) internal successors, (322), 281 states have internal predecessors, (322), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 00:06:11,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 332 transitions. [2025-01-10 00:06:11,107 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 332 transitions. Word has length 3 [2025-01-10 00:06:11,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:06:11,107 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 332 transitions. [2025-01-10 00:06:11,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:06:11,107 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 332 transitions. [2025-01-10 00:06:11,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 00:06:11,108 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:06:11,108 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 00:06:11,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:06:11,108 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2025-01-10 00:06:11,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:06:11,110 INFO L85 PathProgramCache]: Analyzing trace with hash 908297480, now seen corresponding path program 1 times [2025-01-10 00:06:11,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:06:11,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336518143] [2025-01-10 00:06:11,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:11,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:06:11,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:06:11,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:06:11,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:11,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:11,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:06:11,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:06:11,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336518143] [2025-01-10 00:06:11,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336518143] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:06:11,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:06:11,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:06:11,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871621352] [2025-01-10 00:06:11,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:06:11,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:06:11,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:06:11,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:06:11,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:06:11,636 INFO L87 Difference]: Start difference. First operand 290 states and 332 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:06:11,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:06:11,661 INFO L93 Difference]: Finished difference Result 293 states and 336 transitions. [2025-01-10 00:06:11,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:06:11,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-10 00:06:11,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:06:11,664 INFO L225 Difference]: With dead ends: 293 [2025-01-10 00:06:11,664 INFO L226 Difference]: Without dead ends: 293 [2025-01-10 00:06:11,664 INFO L434 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 [2025-01-10 00:06:11,666 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 2 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:06:11,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 653 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:06:11,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-01-10 00:06:11,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 291. [2025-01-10 00:06:11,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 175 states have (on average 1.8457142857142856) internal successors, (323), 282 states have internal predecessors, (323), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 00:06:11,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 333 transitions. [2025-01-10 00:06:11,681 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 333 transitions. Word has length 6 [2025-01-10 00:06:11,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:06:11,681 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 333 transitions. [2025-01-10 00:06:11,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:06:11,681 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 333 transitions. [2025-01-10 00:06:11,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 00:06:11,681 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:06:11,682 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 00:06:11,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:06:11,682 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2025-01-10 00:06:11,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:06:11,682 INFO L85 PathProgramCache]: Analyzing trace with hash 908297289, now seen corresponding path program 1 times [2025-01-10 00:06:11,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:06:11,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085173073] [2025-01-10 00:06:11,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:11,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:06:11,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:06:11,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:06:11,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:11,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:12,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:06:12,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:06:12,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085173073] [2025-01-10 00:06:12,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085173073] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:06:12,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:06:12,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:06:12,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759868792] [2025-01-10 00:06:12,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:06:12,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:06:12,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:06:12,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:06:12,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:06:12,453 INFO L87 Difference]: Start difference. First operand 291 states and 333 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:06:16,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 00:06:20,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 00:06:20,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:06:20,665 INFO L93 Difference]: Finished difference Result 293 states and 335 transitions. [2025-01-10 00:06:20,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:06:20,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-10 00:06:20,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:06:20,667 INFO L225 Difference]: With dead ends: 293 [2025-01-10 00:06:20,667 INFO L226 Difference]: Without dead ends: 293 [2025-01-10 00:06:20,667 INFO L434 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 [2025-01-10 00:06:20,668 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 11 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:06:20,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 544 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 2 Unknown, 0 Unchecked, 8.2s Time] [2025-01-10 00:06:20,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-01-10 00:06:20,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 292. [2025-01-10 00:06:20,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 176 states have (on average 1.8409090909090908) internal successors, (324), 283 states have internal predecessors, (324), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 00:06:20,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 334 transitions. [2025-01-10 00:06:20,677 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 334 transitions. Word has length 6 [2025-01-10 00:06:20,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:06:20,677 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 334 transitions. [2025-01-10 00:06:20,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:06:20,677 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 334 transitions. [2025-01-10 00:06:20,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 00:06:20,678 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:06:20,678 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:06:20,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:06:20,678 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2025-01-10 00:06:20,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:06:20,679 INFO L85 PathProgramCache]: Analyzing trace with hash 790815148, now seen corresponding path program 1 times [2025-01-10 00:06:20,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:06:20,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652037459] [2025-01-10 00:06:20,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:20,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:06:20,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:06:20,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:06:20,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:20,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:21,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:06:21,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:06:21,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652037459] [2025-01-10 00:06:21,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652037459] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:06:21,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648664113] [2025-01-10 00:06:21,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:21,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:06:21,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:06:21,177 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) [2025-01-10 00:06:21,179 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 [2025-01-10 00:06:21,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:06:21,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:06:21,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:21,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:21,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 1265 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 00:06:21,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:06:21,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:06:21,850 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:06:21,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:06:21,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648664113] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:06:21,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:06:21,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 00:06:21,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121846815] [2025-01-10 00:06:21,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:06:21,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:06:21,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:06:21,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:06:21,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:06:21,886 INFO L87 Difference]: Start difference. First operand 292 states and 334 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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) [2025-01-10 00:06:21,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:06:21,920 INFO L93 Difference]: Finished difference Result 300 states and 344 transitions. [2025-01-10 00:06:21,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:06:21,921 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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 9 [2025-01-10 00:06:21,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:06:21,922 INFO L225 Difference]: With dead ends: 300 [2025-01-10 00:06:21,922 INFO L226 Difference]: Without dead ends: 300 [2025-01-10 00:06:21,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:06:21,923 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 4 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:06:21,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 653 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:06:21,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-01-10 00:06:21,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2025-01-10 00:06:21,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 184 states have (on average 1.815217391304348) internal successors, (334), 291 states have internal predecessors, (334), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 00:06:21,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 344 transitions. [2025-01-10 00:06:21,933 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 344 transitions. Word has length 9 [2025-01-10 00:06:21,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:06:21,933 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 344 transitions. [2025-01-10 00:06:21,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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) [2025-01-10 00:06:21,934 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 344 transitions. [2025-01-10 00:06:21,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 00:06:21,934 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:06:21,934 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:06:21,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 00:06:22,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:06:22,138 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2025-01-10 00:06:22,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:06:22,139 INFO L85 PathProgramCache]: Analyzing trace with hash 790814957, now seen corresponding path program 1 times [2025-01-10 00:06:22,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:06:22,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798655408] [2025-01-10 00:06:22,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:22,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:06:22,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:06:22,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:06:22,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:22,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:23,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:06:23,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:06:23,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798655408] [2025-01-10 00:06:23,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798655408] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:06:23,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610827628] [2025-01-10 00:06:23,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:23,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:06:23,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:06:23,016 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) [2025-01-10 00:06:23,020 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 [2025-01-10 00:06:23,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:06:23,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:06:23,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:23,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:23,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 1261 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 00:06:23,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:06:23,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:06:23,845 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:06:24,022 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 7 treesize of output 5 [2025-01-10 00:06:24,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:06:24,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610827628] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:06:24,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:06:24,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-01-10 00:06:24,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245540826] [2025-01-10 00:06:24,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:06:24,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 00:06:24,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:06:24,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 00:06:24,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-01-10 00:06:24,046 INFO L87 Difference]: Start difference. First operand 300 states and 344 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:06:28,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 00:06:32,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 00:06:36,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 00:06:40,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 00:06:44,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 00:06:48,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 00:06:52,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 00:06:56,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 00:06:57,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:06:57,126 INFO L93 Difference]: Finished difference Result 299 states and 341 transitions. [2025-01-10 00:06:57,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:06:57,126 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-10 00:06:57,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:06:57,128 INFO L225 Difference]: With dead ends: 299 [2025-01-10 00:06:57,128 INFO L226 Difference]: Without dead ends: 299 [2025-01-10 00:06:57,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2025-01-10 00:06:57,129 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 292 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 7 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:06:57,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 1279 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 461 Invalid, 8 Unknown, 0 Unchecked, 33.0s Time] [2025-01-10 00:06:57,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-01-10 00:06:57,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2025-01-10 00:06:57,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 184 states have (on average 1.798913043478261) internal successors, (331), 290 states have internal predecessors, (331), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 00:06:57,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 341 transitions. [2025-01-10 00:06:57,138 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 341 transitions. Word has length 9 [2025-01-10 00:06:57,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:06:57,138 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 341 transitions. [2025-01-10 00:06:57,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:06:57,138 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 341 transitions. [2025-01-10 00:06:57,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-10 00:06:57,139 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:06:57,139 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-01-10 00:06:57,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 00:06:57,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:06:57,344 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2025-01-10 00:06:57,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:06:57,344 INFO L85 PathProgramCache]: Analyzing trace with hash -2080538616, now seen corresponding path program 2 times [2025-01-10 00:06:57,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:06:57,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810677455] [2025-01-10 00:06:57,344 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:06:57,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:06:57,614 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-01-10 00:06:57,637 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-01-10 00:06:57,638 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:06:57,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:58,056 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 00:06:58,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:06:58,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810677455] [2025-01-10 00:06:58,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810677455] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:06:58,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:06:58,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:06:58,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134193181] [2025-01-10 00:06:58,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:06:58,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:06:58,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:06:58,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:06:58,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:06:58,059 INFO L87 Difference]: Start difference. First operand 299 states and 341 transitions. Second operand has 6 states, 5 states have (on average 1.8) 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) [2025-01-10 00:06:58,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:06:58,858 INFO L93 Difference]: Finished difference Result 439 states and 507 transitions. [2025-01-10 00:06:58,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:06:58,858 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) 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 18 [2025-01-10 00:06:58,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:06:58,860 INFO L225 Difference]: With dead ends: 439 [2025-01-10 00:06:58,860 INFO L226 Difference]: Without dead ends: 439 [2025-01-10 00:06:58,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:06:58,861 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 258 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-10 00:06:58,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 872 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-10 00:06:58,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-01-10 00:06:58,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 348. [2025-01-10 00:06:58,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 230 states have (on average 1.7869565217391303) internal successors, (411), 336 states have internal predecessors, (411), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 00:06:58,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 425 transitions. [2025-01-10 00:06:58,878 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 425 transitions. Word has length 18 [2025-01-10 00:06:58,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:06:58,878 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 425 transitions. [2025-01-10 00:06:58,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) 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) [2025-01-10 00:06:58,879 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 425 transitions. [2025-01-10 00:06:58,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-10 00:06:58,879 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:06:58,879 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-01-10 00:06:58,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:06:58,880 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2025-01-10 00:06:58,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:06:58,880 INFO L85 PathProgramCache]: Analyzing trace with hash -2080538615, now seen corresponding path program 1 times [2025-01-10 00:06:58,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:06:58,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773235409] [2025-01-10 00:06:58,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:58,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:06:59,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 00:06:59,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 00:06:59,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:59,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:59,418 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:06:59,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:06:59,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773235409] [2025-01-10 00:06:59,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773235409] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:06:59,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469346301] [2025-01-10 00:06:59,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:59,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:06:59,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:06:59,422 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) [2025-01-10 00:06:59,424 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 [2025-01-10 00:06:59,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 00:07:00,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 00:07:00,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:07:00,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:00,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 1328 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 00:07:00,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:07:00,166 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:07:00,167 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:07:00,316 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:07:00,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469346301] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:07:00,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:07:00,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-01-10 00:07:00,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028264405] [2025-01-10 00:07:00,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:07:00,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 00:07:00,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:07:00,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 00:07:00,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:07:00,318 INFO L87 Difference]: Start difference. First operand 348 states and 425 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:07:00,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:07:00,433 INFO L93 Difference]: Finished difference Result 366 states and 443 transitions. [2025-01-10 00:07:00,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:07:00,434 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-01-10 00:07:00,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:07:00,437 INFO L225 Difference]: With dead ends: 366 [2025-01-10 00:07:00,437 INFO L226 Difference]: Without dead ends: 366 [2025-01-10 00:07:00,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:07:00,438 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 4 mSDsluCounter, 1620 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1947 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:07:00,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1947 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:07:00,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-01-10 00:07:00,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2025-01-10 00:07:00,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 248 states have (on average 1.7298387096774193) internal successors, (429), 354 states have internal predecessors, (429), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 00:07:00,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 443 transitions. [2025-01-10 00:07:00,462 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 443 transitions. Word has length 18 [2025-01-10 00:07:00,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:07:00,462 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 443 transitions. [2025-01-10 00:07:00,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:07:00,463 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 443 transitions. [2025-01-10 00:07:00,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-10 00:07:00,463 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:07:00,463 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-01-10 00:07:00,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 00:07:00,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:07:00,664 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2025-01-10 00:07:00,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:07:00,665 INFO L85 PathProgramCache]: Analyzing trace with hash -964458359, now seen corresponding path program 2 times [2025-01-10 00:07:00,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:07:00,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263380752] [2025-01-10 00:07:00,665 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:07:00,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:07:00,934 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-10 00:07:00,959 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 36 statements. [2025-01-10 00:07:00,959 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:07:00,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:01,416 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:07:01,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:07:01,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263380752] [2025-01-10 00:07:01,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263380752] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:07:01,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:07:01,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:07:01,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745528988] [2025-01-10 00:07:01,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:07:01,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:07:01,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:07:01,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:07:01,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:07:01,417 INFO L87 Difference]: Start difference. First operand 366 states and 443 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 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) [2025-01-10 00:07:05,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 00:07:06,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:07:06,295 INFO L93 Difference]: Finished difference Result 581 states and 663 transitions. [2025-01-10 00:07:06,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:07:06,296 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 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 36 [2025-01-10 00:07:06,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:07:06,298 INFO L225 Difference]: With dead ends: 581 [2025-01-10 00:07:06,299 INFO L226 Difference]: Without dead ends: 581 [2025-01-10 00:07:06,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:07:06,299 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 625 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 24 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-01-10 00:07:06,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 619 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 336 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2025-01-10 00:07:06,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2025-01-10 00:07:06,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 369. [2025-01-10 00:07:06,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 251 states have (on average 1.7211155378486056) internal successors, (432), 356 states have internal predecessors, (432), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 00:07:06,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 446 transitions. [2025-01-10 00:07:06,314 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 446 transitions. Word has length 36 [2025-01-10 00:07:06,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:07:06,314 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 446 transitions. [2025-01-10 00:07:06,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 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) [2025-01-10 00:07:06,315 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 446 transitions. [2025-01-10 00:07:06,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-10 00:07:06,316 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:07:06,316 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:07:06,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:07:06,316 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2025-01-10 00:07:06,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:07:06,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1866656375, now seen corresponding path program 1 times [2025-01-10 00:07:06,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:07:06,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721971066] [2025-01-10 00:07:06,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:07:06,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:07:06,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-10 00:07:06,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 00:07:06,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:07:06,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:06,958 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:07:06,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:07:06,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721971066] [2025-01-10 00:07:06,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721971066] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:07:06,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:07:06,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:07:06,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134223765] [2025-01-10 00:07:06,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:07:06,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:07:06,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:07:06,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:07:06,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:07:06,960 INFO L87 Difference]: Start difference. First operand 369 states and 446 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:07:10,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 00:07:11,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:07:11,396 INFO L93 Difference]: Finished difference Result 447 states and 516 transitions. [2025-01-10 00:07:11,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:07:11,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2025-01-10 00:07:11,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:07:11,398 INFO L225 Difference]: With dead ends: 447 [2025-01-10 00:07:11,399 INFO L226 Difference]: Without dead ends: 447 [2025-01-10 00:07:11,399 INFO L434 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 [2025-01-10 00:07:11,399 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 203 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-01-10 00:07:11,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 401 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 168 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2025-01-10 00:07:11,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2025-01-10 00:07:11,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 364. [2025-01-10 00:07:11,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 251 states have (on average 1.701195219123506) internal successors, (427), 351 states have internal predecessors, (427), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 00:07:11,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 441 transitions. [2025-01-10 00:07:11,416 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 441 transitions. Word has length 44 [2025-01-10 00:07:11,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:07:11,417 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 441 transitions. [2025-01-10 00:07:11,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:07:11,418 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 441 transitions. [2025-01-10 00:07:11,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-10 00:07:11,420 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:07:11,421 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:07:11,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:07:11,421 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2025-01-10 00:07:11,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:07:11,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1866656374, now seen corresponding path program 1 times [2025-01-10 00:07:11,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:07:11,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170642102] [2025-01-10 00:07:11,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:07:11,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:07:11,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-10 00:07:11,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 00:07:11,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:07:11,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:12,705 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:07:12,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:07:12,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170642102] [2025-01-10 00:07:12,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170642102] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:07:12,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:07:12,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:07:12,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207154765] [2025-01-10 00:07:12,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:07:12,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:07:12,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:07:12,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:07:12,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:07:12,709 INFO L87 Difference]: Start difference. First operand 364 states and 441 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:07:16,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 00:07:17,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:07:17,438 INFO L93 Difference]: Finished difference Result 404 states and 489 transitions. [2025-01-10 00:07:17,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:07:17,439 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2025-01-10 00:07:17,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:07:17,442 INFO L225 Difference]: With dead ends: 404 [2025-01-10 00:07:17,443 INFO L226 Difference]: Without dead ends: 404 [2025-01-10 00:07:17,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:07:17,443 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 299 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-01-10 00:07:17,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 1157 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 196 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2025-01-10 00:07:17,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-01-10 00:07:17,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 363. [2025-01-10 00:07:17,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 251 states have (on average 1.697211155378486) internal successors, (426), 350 states have internal predecessors, (426), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 00:07:17,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 440 transitions. [2025-01-10 00:07:17,459 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 440 transitions. Word has length 44 [2025-01-10 00:07:17,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:07:17,459 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 440 transitions. [2025-01-10 00:07:17,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:07:17,460 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 440 transitions. [2025-01-10 00:07:17,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-10 00:07:17,464 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:07:17,465 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:07:17,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:07:17,465 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2025-01-10 00:07:17,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:07:17,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1676766104, now seen corresponding path program 1 times [2025-01-10 00:07:17,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:07:17,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231716953] [2025-01-10 00:07:17,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:07:17,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:07:17,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 00:07:17,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 00:07:17,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:07:17,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:18,515 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:07:18,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:07:18,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231716953] [2025-01-10 00:07:18,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231716953] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:07:18,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:07:18,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:07:18,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025311561] [2025-01-10 00:07:18,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:07:18,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:07:18,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:07:18,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:07:18,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:07:18,520 INFO L87 Difference]: Start difference. First operand 363 states and 440 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)